./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:44:10,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:44:10,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:44:10,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:44:10,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:44:10,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:44:10,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:44:10,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:44:10,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:44:10,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:44:10,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:44:10,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:44:10,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:44:10,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:44:10,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:44:10,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:44:10,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:44:10,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:44:10,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:44:10,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:44:10,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:44:10,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:44:10,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:44:10,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:44:10,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:44:10,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:44:10,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:44:10,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:44:10,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:44:10,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:44:10,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:44:10,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:44:10,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:44:10,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:44:10,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:44:10,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:44:10,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:44:10,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:44:10,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:44:10,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:44:10,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:44:10,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:44:11,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:44:11,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:44:11,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:44:11,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:44:11,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:44:11,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:44:11,041 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:44:11,042 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:44:11,042 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:44:11,042 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:44:11,043 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:44:11,044 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:44:11,044 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:44:11,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:44:11,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:44:11,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:44:11,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:44:11,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:44:11,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:44:11,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:44:11,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:44:11,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:44:11,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:44:11,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:44:11,046 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:44:11,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:44:11,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:44:11,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:44:11,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:44:11,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:44:11,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:44:11,049 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:44:11,049 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e [2022-11-16 11:44:11,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:44:11,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:44:11,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:44:11,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:44:11,356 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:44:11,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:44:11,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/data/2739f6e85/2e98a02df1c448c490b2d1872aaa6d10/FLAG4afa79184 [2022-11-16 11:44:11,940 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:44:11,941 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:44:11,951 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/data/2739f6e85/2e98a02df1c448c490b2d1872aaa6d10/FLAG4afa79184 [2022-11-16 11:44:12,291 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/data/2739f6e85/2e98a02df1c448c490b2d1872aaa6d10 [2022-11-16 11:44:12,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:44:12,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:44:12,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:44:12,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:44:12,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:44:12,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a74daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12, skipping insertion in model container [2022-11-16 11:44:12,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:44:12,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:44:12,585 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-11-16 11:44:12,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:44:12,595 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:44:12,677 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-11-16 11:44:12,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:44:12,692 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:44:12,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12 WrapperNode [2022-11-16 11:44:12,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:44:12,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:44:12,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:44:12,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:44:12,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,742 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 333 [2022-11-16 11:44:12,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:44:12,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:44:12,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:44:12,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:44:12,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:44:12,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:44:12,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:44:12,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:44:12,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (1/1) ... [2022-11-16 11:44:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:44:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:44:12,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:44:12,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f34cb6-d9f9-4dd5-b3be-fc097ec3ceae/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:44:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:44:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:44:12,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:44:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:44:13,085 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:44:13,088 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:44:13,668 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:44:13,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:44:13,676 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:44:13,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:44:13 BoogieIcfgContainer [2022-11-16 11:44:13,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:44:13,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:44:13,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:44:13,700 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:44:13,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:44:13,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:44:12" (1/3) ... [2022-11-16 11:44:13,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d8bc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:44:13, skipping insertion in model container [2022-11-16 11:44:13,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:44:13,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:12" (2/3) ... [2022-11-16 11:44:13,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d8bc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:44:13, skipping insertion in model container [2022-11-16 11:44:13,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:44:13,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:44:13" (3/3) ... [2022-11-16 11:44:13,705 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:44:13,815 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:44:13,815 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:44:13,825 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:44:13,825 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:44:13,826 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:44:13,826 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:44:13,826 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:44:13,826 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:44:13,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 101 states, 100 states have (on average 1.74) internal successors, (174), 100 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:13,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-11-16 11:44:13,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:44:13,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:44:13,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:13,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:13,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:44:13,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 101 states, 100 states have (on average 1.74) internal successors, (174), 100 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:13,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-11-16 11:44:13,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:44:13,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:44:13,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:13,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:13,901 INFO L748 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~alive2~0 := 0;~send1~0 := 0;~alive1~0 := 0;~send2~0 := 0;~alive4~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~alive3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 97#L248true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 56#L248-1true init_#res#1 := init_~tmp~0#1; 95#L377true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 29#L22true assume !(0 == assume_abort_if_not_~cond#1); 71#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 42#L446-2true [2022-11-16 11:44:13,912 INFO L750 eck$LassoCheckResult]: Loop: 42#L446-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 51#L76true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 8#L80true assume !(node1_~m1~0#1 != ~nomsg~0); 83#L80-1true ~mode1~0 := 0; 88#L76-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 80#L113true assume !(0 != ~mode2~0 % 256); 40#L130true assume 0 != ~alive2~0 % 256;~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256); 17#L133-2true ~mode2~0 := 1; 32#L113-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 84#L147true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 73#L150true assume !(node3_~m3~0#1 != ~nomsg~0); 6#L150-1true ~mode3~0 := 0; 64#L147-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 70#L181true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 61#L184true assume !(node4_~m4~0#1 != ~nomsg~0); 89#L184-1true ~mode4~0 := 0; 33#L181-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 99#L215true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 27#L218true assume !(node5_~m5~0#1 != ~nomsg~0); 28#L218-1true ~mode5~0 := 0; 87#L215-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 11#L385true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 86#L385-1true check_#res#1 := check_~tmp~1#1; 92#L397true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 30#L476true assume !(0 == assert_~arg#1 % 256); 18#L471true assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 42#L446-2true [2022-11-16 11:44:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2022-11-16 11:44:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:13,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375692924] [2022-11-16 11:44:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:44:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375692924] [2022-11-16 11:44:14,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375692924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:14,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:14,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:44:14,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903757093] [2022-11-16 11:44:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:14,197 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:44:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1186015985, now seen corresponding path program 1 times [2022-11-16 11:44:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:14,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571194971] [2022-11-16 11:44:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:44:14,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571194971] [2022-11-16 11:44:14,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571194971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:44:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131941915] [2022-11-16 11:44:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:14,564 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:44:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:44:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:44:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:44:14,603 INFO L87 Difference]: Start difference. First operand has 101 states, 100 states have (on average 1.74) internal successors, (174), 100 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:14,712 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2022-11-16 11:44:14,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 173 transitions. [2022-11-16 11:44:14,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-16 11:44:14,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 96 states and 134 transitions. [2022-11-16 11:44:14,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-11-16 11:44:14,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-11-16 11:44:14,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 134 transitions. [2022-11-16 11:44:14,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:44:14,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 134 transitions. [2022-11-16 11:44:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 134 transitions. [2022-11-16 11:44:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-16 11:44:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 95 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2022-11-16 11:44:14,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 134 transitions. [2022-11-16 11:44:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:44:14,766 INFO L428 stractBuchiCegarLoop]: Abstraction has 96 states and 134 transitions. [2022-11-16 11:44:14,766 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:44:14,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 134 transitions. [2022-11-16 11:44:14,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-16 11:44:14,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:44:14,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:44:14,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:14,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:14,771 INFO L748 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~alive2~0 := 0;~send1~0 := 0;~alive1~0 := 0;~send2~0 := 0;~alive4~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~alive3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 286#L248 assume 0 == ~r1~0; 235#L249 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 236#L250 assume ~id1~0 >= 0; 251#L251 assume 0 == ~st1~0; 252#L252 assume ~send1~0 == ~id1~0; 258#L253 assume 0 == ~mode1~0 % 256; 259#L254 assume ~id2~0 >= 0; 260#L255 assume 0 == ~st2~0; 261#L256 assume ~send2~0 == ~id2~0; 306#L257 assume 0 == ~mode2~0 % 256; 283#L258 assume ~id3~0 >= 0; 223#L259 assume 0 == ~st3~0; 224#L260 assume ~send3~0 == ~id3~0; 318#L261 assume 0 == ~mode3~0 % 256; 310#L262 assume ~id4~0 >= 0; 311#L263 assume 0 == ~st4~0; 312#L264 assume ~send4~0 == ~id4~0; 225#L265 assume 0 == ~mode4~0 % 256; 226#L266 assume ~id5~0 >= 0; 249#L267 assume 0 == ~st5~0; 269#L268 assume ~send5~0 == ~id5~0; 270#L269 assume 0 == ~mode5~0 % 256; 239#L270 assume ~id1~0 != ~id2~0; 240#L271 assume ~id1~0 != ~id3~0; 284#L272 assume ~id1~0 != ~id4~0; 296#L273 assume ~id1~0 != ~id5~0; 267#L274 assume ~id2~0 != ~id3~0; 268#L275 assume ~id2~0 != ~id4~0; 227#L276 assume ~id2~0 != ~id5~0; 228#L277 assume ~id3~0 != ~id4~0; 314#L278 assume ~id3~0 != ~id5~0; 309#L279 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 244#L248-1 init_#res#1 := init_~tmp~0#1; 245#L377 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 294#L22 assume !(0 == assume_abort_if_not_~cond#1); 279#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 277#L446-2 [2022-11-16 11:44:14,771 INFO L750 eck$LassoCheckResult]: Loop: 277#L446-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 313#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 241#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 243#L80-1 ~mode1~0 := 0; 298#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 299#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 278#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 233#L116-1 ~mode2~0 := 0; 275#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 304#L147 assume !(0 != ~mode3~0 % 256); 262#L164 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 263#L167-2 ~mode3~0 := 1; 238#L147-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 265#L181 assume !(0 != ~mode4~0 % 256); 229#L198 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 230#L201-2 ~mode4~0 := 1; 301#L181-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 305#L215 assume !(0 != ~mode5~0 % 256); 317#L232 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 303#L235-2 ~mode5~0 := 1; 292#L215-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 250#L385 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 247#L385-1 check_#res#1 := check_~tmp~1#1; 307#L397 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 295#L476 assume !(0 == assert_~arg#1 % 256); 276#L471 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 277#L446-2 [2022-11-16 11:44:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2022-11-16 11:44:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:14,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178965386] [2022-11-16 11:44:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:14,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:44:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:14,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:44:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2119970671, now seen corresponding path program 1 times [2022-11-16 11:44:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:14,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102405714] [2022-11-16 11:44:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:44:15,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102405714] [2022-11-16 11:44:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102405714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:15,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:15,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:44:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978419798] [2022-11-16 11:44:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:15,231 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:44:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:44:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:44:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:44:15,232 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:15,306 INFO L93 Difference]: Finished difference Result 99 states and 136 transitions. [2022-11-16 11:44:15,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 136 transitions. [2022-11-16 11:44:15,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-16 11:44:15,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 96 states and 132 transitions. [2022-11-16 11:44:15,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-11-16 11:44:15,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-11-16 11:44:15,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 132 transitions. [2022-11-16 11:44:15,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:44:15,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 132 transitions. [2022-11-16 11:44:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 132 transitions. [2022-11-16 11:44:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-16 11:44:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.375) internal successors, (132), 95 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2022-11-16 11:44:15,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 132 transitions. [2022-11-16 11:44:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:44:15,318 INFO L428 stractBuchiCegarLoop]: Abstraction has 96 states and 132 transitions. [2022-11-16 11:44:15,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:44:15,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 132 transitions. [2022-11-16 11:44:15,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-11-16 11:44:15,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:44:15,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:44:15,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:15,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:15,321 INFO L748 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~alive2~0 := 0;~send1~0 := 0;~alive1~0 := 0;~send2~0 := 0;~alive4~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~alive3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 493#L248 assume 0 == ~r1~0; 439#L249 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 440#L250 assume ~id1~0 >= 0; 458#L251 assume 0 == ~st1~0; 459#L252 assume ~send1~0 == ~id1~0; 465#L253 assume 0 == ~mode1~0 % 256; 466#L254 assume ~id2~0 >= 0; 467#L255 assume 0 == ~st2~0; 468#L256 assume ~send2~0 == ~id2~0; 513#L257 assume 0 == ~mode2~0 % 256; 490#L258 assume ~id3~0 >= 0; 430#L259 assume 0 == ~st3~0; 431#L260 assume ~send3~0 == ~id3~0; 525#L261 assume 0 == ~mode3~0 % 256; 517#L262 assume ~id4~0 >= 0; 518#L263 assume 0 == ~st4~0; 519#L264 assume ~send4~0 == ~id4~0; 432#L265 assume 0 == ~mode4~0 % 256; 433#L266 assume ~id5~0 >= 0; 456#L267 assume 0 == ~st5~0; 476#L268 assume ~send5~0 == ~id5~0; 477#L269 assume 0 == ~mode5~0 % 256; 446#L270 assume ~id1~0 != ~id2~0; 447#L271 assume ~id1~0 != ~id3~0; 491#L272 assume ~id1~0 != ~id4~0; 503#L273 assume ~id1~0 != ~id5~0; 474#L274 assume ~id2~0 != ~id3~0; 475#L275 assume ~id2~0 != ~id4~0; 434#L276 assume ~id2~0 != ~id5~0; 435#L277 assume ~id3~0 != ~id4~0; 521#L278 assume ~id3~0 != ~id5~0; 516#L279 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 451#L248-1 init_#res#1 := init_~tmp~0#1; 452#L377 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 502#L22 assume !(0 == assume_abort_if_not_~cond#1); 486#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 482#L446-2 [2022-11-16 11:44:15,322 INFO L750 eck$LassoCheckResult]: Loop: 482#L446-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 520#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 448#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 450#L80-1 ~mode1~0 := 0; 508#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 509#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 485#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 442#L116-1 ~mode2~0 := 0; 484#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 511#L147 assume !(0 != ~mode3~0 % 256); 469#L164 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 470#L167-2 ~mode3~0 := 1; 445#L147-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 472#L181 assume !(0 != ~mode4~0 % 256); 436#L198 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 437#L201-2 ~mode4~0 := 1; 505#L181-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 512#L215 assume !(0 != ~mode5~0 % 256); 524#L232 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 507#L235-2 ~mode5~0 := 1; 497#L215-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 457#L385 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 453#L386 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 454#L385-1 check_#res#1 := check_~tmp~1#1; 514#L397 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 501#L476 assume !(0 == assert_~arg#1 % 256); 481#L471 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 482#L446-2 [2022-11-16 11:44:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2022-11-16 11:44:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:15,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943802327] [2022-11-16 11:44:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:15,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:44:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:15,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:44:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1677908485, now seen corresponding path program 1 times [2022-11-16 11:44:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3959898] [2022-11-16 11:44:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:15,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:44:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:44:15,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:44:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -315996507, now seen corresponding path program 1 times [2022-11-16 11:44:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:44:15,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542012892] [2022-11-16 11:44:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:44:15,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542012892] [2022-11-16 11:44:15,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542012892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:15,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:15,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38470844] [2022-11-16 11:44:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:19,379 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:44:19,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:44:19,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:44:19,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:44:19,381 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:44:19,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:44:19,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:44:19,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:44:19,381 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-11-16 11:44:19,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:44:19,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:44:19,422 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,439 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,445 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,448 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,454 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,456 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:19,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:20,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:20,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:20,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:20,502 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:20,505 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:44:22,107 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18