./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b 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_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN --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 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d --- 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-6b4ec56 [2022-11-20 10:46:46,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:46:46,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:46:46,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:46:46,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:46:46,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:46:46,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:46:46,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:46:46,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:46:46,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:46:46,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:46:46,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:46:46,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:46:46,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:46:46,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:46:46,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:46:46,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:46:46,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:46:46,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:46:46,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:46:46,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:46:46,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:46:46,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:46:46,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:46:46,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:46:46,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:46:46,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:46:46,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:46:46,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:46:46,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:46:46,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:46:46,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:46:46,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:46:46,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:46:46,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:46:46,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:46:46,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:46:46,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:46:46,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:46:46,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:46:46,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:46:46,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 10:46:47,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:46:47,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:46:47,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:46:47,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:46:47,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:46:47,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:46:47,003 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:46:47,003 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:46:47,003 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:46:47,003 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:46:47,003 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:46:47,004 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:46:47,004 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:46:47,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:46:47,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:46:47,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:46:47,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:46:47,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:46:47,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:46:47,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:46:47,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:46:47,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:46:47,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:46:47,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:46:47,013 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:46:47,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:46:47,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:46:47,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:46:47,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:46:47,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:46:47,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:46:47,019 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:46:47,019 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_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/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_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN 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 -> 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d [2022-11-20 10:46:47,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:46:47,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:46:47,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:46:47,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:46:47,363 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:46:47,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-11-20 10:46:50,571 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:46:50,801 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:46:50,802 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-11-20 10:46:50,811 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/data/db2852ae7/d3fb6a76fddb4abe8200e4975106cc51/FLAG5d97b3226 [2022-11-20 10:46:50,839 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/data/db2852ae7/d3fb6a76fddb4abe8200e4975106cc51 [2022-11-20 10:46:50,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:46:50,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:46:50,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:46:50,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:46:50,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:46:50,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:46:50" (1/1) ... [2022-11-20 10:46:50,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5aa959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:50, skipping insertion in model container [2022-11-20 10:46:50,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:46:50" (1/1) ... [2022-11-20 10:46:50,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:46:50,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:46:51,236 WARN L237 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_6c594786-e754-4711-818f-f269d64f7c38/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2022-11-20 10:46:51,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:46:51,264 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:46:51,354 WARN L237 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_6c594786-e754-4711-818f-f269d64f7c38/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2022-11-20 10:46:51,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:46:51,378 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:46:51,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51 WrapperNode [2022-11-20 10:46:51,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:46:51,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:46:51,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:46:51,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:46:51,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,471 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 245 [2022-11-20 10:46:51,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:46:51,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:46:51,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:46:51,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:46:51,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:46:51,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:46:51,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:46:51,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:46:51,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (1/1) ... [2022-11-20 10:46:51,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:46:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:51,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:46:51,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c594786-e754-4711-818f-f269d64f7c38/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:46:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:46:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:46:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:46:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:46:51,778 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:46:51,780 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:46:52,292 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:46:52,303 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:46:52,303 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:46:52,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:46:52 BoogieIcfgContainer [2022-11-20 10:46:52,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:46:52,309 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:46:52,309 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:46:52,315 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:46:52,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:46:52,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:46:50" (1/3) ... [2022-11-20 10:46:52,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29e2e7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:46:52, skipping insertion in model container [2022-11-20 10:46:52,320 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:46:52,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:51" (2/3) ... [2022-11-20 10:46:52,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29e2e7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:46:52, skipping insertion in model container [2022-11-20 10:46:52,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:46:52,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:46:52" (3/3) ... [2022-11-20 10:46:52,326 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2022-11-20 10:46:52,417 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:46:52,417 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:46:52,418 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:46:52,418 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:46:52,418 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:46:52,418 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:46:52,418 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:46:52,419 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:46:52,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 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-20 10:46:52,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2022-11-20 10:46:52,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:46:52,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:46:52,454 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:52,454 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:52,454 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:46:52,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 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-20 10:46:52,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2022-11-20 10:46:52,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:46:52,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:46:52,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:52,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:52,470 INFO L748 eck$LassoCheckResult]: Stem: 48#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 38#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~ret21#1, main_#t~ret22#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 61#L169true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 50#L169-1true init_#res#1 := init_~tmp~0#1; 59#L262true main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 43#L22true assume !(0 == assume_abort_if_not_~cond#1); 25#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;main_~i2~0#1 := 0; 4#L328-2true [2022-11-20 10:46:52,471 INFO L750 eck$LassoCheckResult]: Loop: 4#L328-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 15#L64true assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 70#L64-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; 17#L95true assume !(0 != ~mode2~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);~mode2~0 := 1; 31#L95-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; 47#L120true assume !(0 != ~mode3~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);~mode3~0 := 1; 28#L120-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; 60#L145true assume !(0 != ~mode4~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);~mode4~0 := 1; 49#L145-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 7#L270true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 10#L270-1true check_#res#1 := check_~tmp~1#1; 64#L290true main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 57#L354true assume !(0 == assert_~arg#1 % 256); 14#L349true assume { :end_inline_assert } true; 4#L328-2true [2022-11-20 10:46:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-11-20 10:46:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:52,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644576258] [2022-11-20 10:46:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,979 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-20 10:46:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:52,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644576258] [2022-11-20 10:46:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644576258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:52,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:52,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:46:52,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412780821] [2022-11-20 10:46:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:52,993 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:46:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash 839632324, now seen corresponding path program 1 times [2022-11-20 10:46:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:52,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153619397] [2022-11-20 10:46:52,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:53,492 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-20 10:46:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:53,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153619397] [2022-11-20 10:46:53,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153619397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:53,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:53,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:46:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617955] [2022-11-20 10:46:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:53,497 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:46:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:46:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:46:53,542 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 1.710144927536232) internal successors, (118), 69 states have internal predecessors, (118), 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-20 10:46:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:53,663 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-11-20 10:46:53,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 113 transitions. [2022-11-20 10:46:53,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 10:46:53,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 65 states and 87 transitions. [2022-11-20 10:46:53,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-11-20 10:46:53,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-11-20 10:46:53,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 87 transitions. [2022-11-20 10:46:53,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:46:53,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-11-20 10:46:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 87 transitions. [2022-11-20 10:46:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:46:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 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-20 10:46:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-11-20 10:46:53,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-11-20 10:46:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:46:53,729 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-11-20 10:46:53,729 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:46:53,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 87 transitions. [2022-11-20 10:46:53,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 10:46:53,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:46:53,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:46:53,739 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] [2022-11-20 10:46:53,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:53,740 INFO L748 eck$LassoCheckResult]: Stem: 215#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 206#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~ret21#1, main_#t~ret22#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 207#L169 assume 0 == ~r1~0 % 256; 220#L170 assume ~id1~0 >= 0; 212#L171 assume 0 == ~st1~0; 208#L172 assume ~send1~0 == ~id1~0; 209#L173 assume 0 == ~mode1~0 % 256; 218#L174 assume ~id2~0 >= 0; 161#L175 assume 0 == ~st2~0; 162#L176 assume ~send2~0 == ~id2~0; 214#L177 assume 0 == ~mode2~0 % 256; 195#L178 assume ~id3~0 >= 0; 196#L179 assume 0 == ~st3~0; 157#L180 assume ~send3~0 == ~id3~0; 158#L181 assume 0 == ~mode3~0 % 256; 193#L182 assume ~id4~0 >= 0; 194#L183 assume 0 == ~st4~0; 177#L184 assume ~send4~0 == ~id4~0; 178#L185 assume 0 == ~mode4~0 % 256; 201#L186 assume ~id1~0 != ~id2~0; 216#L187 assume ~id1~0 != ~id3~0; 179#L188 assume ~id1~0 != ~id4~0; 180#L189 assume ~id2~0 != ~id3~0; 182#L190 assume ~id2~0 != ~id4~0; 169#L191 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 170#L169-1 init_#res#1 := init_~tmp~0#1; 217#L262 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 213#L22 assume !(0 == assume_abort_if_not_~cond#1); 197#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;main_~i2~0#1 := 0; 159#L328-2 [2022-11-20 10:46:53,740 INFO L750 eck$LassoCheckResult]: Loop: 159#L328-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 160#L64 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 184#L64-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; 187#L95 assume !(0 != ~mode2~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);~mode2~0 := 1; 176#L95-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; 202#L120 assume !(0 != ~mode3~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);~mode3~0 := 1; 199#L120-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; 200#L145 assume !(0 != ~mode4~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);~mode4~0 := 1; 205#L145-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 166#L270 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 168#L270-1 check_#res#1 := check_~tmp~1#1; 174#L290 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 219#L354 assume !(0 == assert_~arg#1 % 256); 181#L349 assume { :end_inline_assert } true; 159#L328-2 [2022-11-20 10:46:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-11-20 10:46:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:53,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19554171] [2022-11-20 10:46:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:53,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:46:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:53,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:46:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 839632324, now seen corresponding path program 2 times [2022-11-20 10:46:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:53,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306041641] [2022-11-20 10:46:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,052 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-20 10:46:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:54,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306041641] [2022-11-20 10:46:54,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306041641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:54,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:54,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:46:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094857969] [2022-11-20 10:46:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:54,054 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:46:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:54,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:46:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:46:54,058 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. cyclomatic complexity: 23 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-20 10:46:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:54,132 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-20 10:46:54,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2022-11-20 10:46:54,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 10:46:54,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 65 states and 84 transitions. [2022-11-20 10:46:54,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-11-20 10:46:54,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-11-20 10:46:54,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 84 transitions. [2022-11-20 10:46:54,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:46:54,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-20 10:46:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 84 transitions. [2022-11-20 10:46:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:46:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 64 states have internal predecessors, (84), 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-20 10:46:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-20 10:46:54,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-20 10:46:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:46:54,157 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-20 10:46:54,157 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:46:54,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 84 transitions. [2022-11-20 10:46:54,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 10:46:54,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:46:54,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:46:54,166 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] [2022-11-20 10:46:54,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:54,166 INFO L748 eck$LassoCheckResult]: Stem: 360#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 351#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~ret21#1, main_#t~ret22#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 352#L169 assume 0 == ~r1~0 % 256; 365#L170 assume ~id1~0 >= 0; 357#L171 assume 0 == ~st1~0; 353#L172 assume ~send1~0 == ~id1~0; 354#L173 assume 0 == ~mode1~0 % 256; 363#L174 assume ~id2~0 >= 0; 306#L175 assume 0 == ~st2~0; 307#L176 assume ~send2~0 == ~id2~0; 359#L177 assume 0 == ~mode2~0 % 256; 341#L178 assume ~id3~0 >= 0; 342#L179 assume 0 == ~st3~0; 302#L180 assume ~send3~0 == ~id3~0; 303#L181 assume 0 == ~mode3~0 % 256; 338#L182 assume ~id4~0 >= 0; 339#L183 assume 0 == ~st4~0; 322#L184 assume ~send4~0 == ~id4~0; 323#L185 assume 0 == ~mode4~0 % 256; 346#L186 assume ~id1~0 != ~id2~0; 361#L187 assume ~id1~0 != ~id3~0; 324#L188 assume ~id1~0 != ~id4~0; 325#L189 assume ~id2~0 != ~id3~0; 329#L190 assume ~id2~0 != ~id4~0; 313#L191 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 314#L169-1 init_#res#1 := init_~tmp~0#1; 362#L262 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 358#L22 assume !(0 == assume_abort_if_not_~cond#1); 340#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;main_~i2~0#1 := 0; 304#L328-2 [2022-11-20 10:46:54,167 INFO L750 eck$LassoCheckResult]: Loop: 304#L328-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 305#L64 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 328#L64-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; 330#L95 assume !(0 != ~mode2~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);~mode2~0 := 1; 321#L95-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; 347#L120 assume !(0 != ~mode3~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);~mode3~0 := 1; 344#L120-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; 345#L145 assume !(0 != ~mode4~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);~mode4~0 := 1; 350#L145-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 311#L270 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 312#L271 assume ~r1~0 % 256 >= 4; 333#L275 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 318#L270-1 check_#res#1 := check_~tmp~1#1; 319#L290 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 364#L354 assume !(0 == assert_~arg#1 % 256); 326#L349 assume { :end_inline_assert } true; 304#L328-2 [2022-11-20 10:46:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-11-20 10:46:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:54,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766409517] [2022-11-20 10:46:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:46:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:46:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1983010188, now seen corresponding path program 1 times [2022-11-20 10:46:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517207600] [2022-11-20 10:46:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,305 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-20 10:46:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:54,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517207600] [2022-11-20 10:46:54,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517207600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:54,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:54,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:46:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149668022] [2022-11-20 10:46:54,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:54,307 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 10:46:54,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:46:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:54,309 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-20 10:46:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:54,363 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2022-11-20 10:46:54,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 128 transitions. [2022-11-20 10:46:54,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-11-20 10:46:54,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 128 transitions. [2022-11-20 10:46:54,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-20 10:46:54,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-20 10:46:54,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 128 transitions. [2022-11-20 10:46:54,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:46:54,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 128 transitions. [2022-11-20 10:46:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 128 transitions. [2022-11-20 10:46:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-11-20 10:46:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 92 states have internal predecessors, (125), 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-20 10:46:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2022-11-20 10:46:54,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-11-20 10:46:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:46:54,414 INFO L428 stractBuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-11-20 10:46:54,415 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:46:54,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 125 transitions. [2022-11-20 10:46:54,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-11-20 10:46:54,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:46:54,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:46:54,421 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] [2022-11-20 10:46:54,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:54,422 INFO L748 eck$LassoCheckResult]: Stem: 529#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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 520#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~ret21#1, main_#t~ret22#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;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 521#L169 assume 0 == ~r1~0 % 256; 534#L170 assume ~id1~0 >= 0; 526#L171 assume 0 == ~st1~0; 522#L172 assume ~send1~0 == ~id1~0; 523#L173 assume 0 == ~mode1~0 % 256; 532#L174 assume ~id2~0 >= 0; 472#L175 assume 0 == ~st2~0; 473#L176 assume ~send2~0 == ~id2~0; 528#L177 assume 0 == ~mode2~0 % 256; 507#L178 assume ~id3~0 >= 0; 508#L179 assume 0 == ~st3~0; 468#L180 assume ~send3~0 == ~id3~0; 469#L181 assume 0 == ~mode3~0 % 256; 505#L182 assume ~id4~0 >= 0; 506#L183 assume 0 == ~st4~0; 488#L184 assume ~send4~0 == ~id4~0; 489#L185 assume 0 == ~mode4~0 % 256; 512#L186 assume ~id1~0 != ~id2~0; 530#L187 assume ~id1~0 != ~id3~0; 490#L188 assume ~id1~0 != ~id4~0; 491#L189 assume ~id2~0 != ~id3~0; 493#L190 assume ~id2~0 != ~id4~0; 479#L191 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 480#L169-1 init_#res#1 := init_~tmp~0#1; 531#L262 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 527#L22 assume !(0 == assume_abort_if_not_~cond#1); 509#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;main_~i2~0#1 := 0; 510#L328-2 [2022-11-20 10:46:54,422 INFO L750 eck$LassoCheckResult]: Loop: 510#L328-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 556#L64 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 500#L64-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; 552#L95 assume !(0 != ~mode2~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);~mode2~0 := 1; 550#L95-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; 545#L120 assume !(0 != ~mode3~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);~mode3~0 := 1; 542#L120-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; 540#L145 assume !(0 != ~mode4~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);~mode4~0 := 1; 538#L145-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 537#L270 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 536#L271 assume !(~r1~0 % 256 >= 4); 498#L274 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 499#L275 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 560#L270-1 check_#res#1 := check_~tmp~1#1; 559#L290 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 558#L354 assume !(0 == assert_~arg#1 % 256); 557#L349 assume { :end_inline_assert } true; 510#L328-2 [2022-11-20 10:46:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-11-20 10:46:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:54,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346295047] [2022-11-20 10:46:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:46:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:46:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash 302798199, now seen corresponding path program 1 times [2022-11-20 10:46:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:54,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250496196] [2022-11-20 10:46:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:46:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:46:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash 339850705, now seen corresponding path program 1 times [2022-11-20 10:46:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747289184] [2022-11-20 10:46:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:46:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:46:54,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:46:58,491 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:46:58,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:46:58,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:46:58,492 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:46:58,492 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 10:46:58,492 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:46:58,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:46:58,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:46:58,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-20 10:46:58,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:46:58,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:46:58,557 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-20 10:46:58,571 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-20 10:46:58,577 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-20 10:46:58,582 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-20 10:46:58,585 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-20 10:47:00,251 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-20 10:47:00,267 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-20 10:47:00,270 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-20 10:47:00,275 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-20 10:47:00,285 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-20 10:47:02,043 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 24