./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a --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 64bit --witnessprinter.graph.data.programhash 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- 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-b5237d8 [2022-11-21 16:49:55,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:49:55,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:49:55,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:49:55,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:49:55,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:49:55,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:49:55,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:49:55,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:49:55,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:49:55,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:49:55,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:49:55,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:49:55,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:49:55,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:49:55,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:49:55,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:49:55,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:49:55,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:49:55,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:49:55,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:49:55,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:49:55,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:49:55,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:49:56,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:49:56,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:49:56,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:49:56,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:49:56,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:49:56,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:49:56,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:49:56,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:49:56,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:49:56,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:49:56,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:49:56,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:49:56,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:49:56,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:49:56,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:49:56,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:49:56,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:49:56,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-21 16:49:56,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:49:56,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:49:56,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:49:56,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:49:56,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:49:56,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:49:56,063 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:49:56,064 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 16:49:56,064 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 16:49:56,064 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 16:49:56,066 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 16:49:56,066 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 16:49:56,066 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 16:49:56,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:49:56,067 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:49:56,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:49:56,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:49:56,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 16:49:56,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 16:49:56,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 16:49:56,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:49:56,069 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 16:49:56,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:49:56,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 16:49:56,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:49:56,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:49:56,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:49:56,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:49:56,072 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 16:49:56,072 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_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/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_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2022-11-21 16:49:56,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:49:56,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:49:56,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:49:56,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:49:56,464 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:49:56,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2022-11-21 16:49:59,923 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:50:00,280 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:50:00,280 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2022-11-21 16:50:00,295 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/data/c268651cd/de48dacad9c04f88846a3ca5ee8512c8/FLAGdb7fcb848 [2022-11-21 16:50:00,312 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/data/c268651cd/de48dacad9c04f88846a3ca5ee8512c8 [2022-11-21 16:50:00,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:50:00,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:50:00,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:50:00,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:50:00,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:50:00,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4d5450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00, skipping insertion in model container [2022-11-21 16:50:00,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:50:00,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:50:00,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:50:00,740 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:50:00,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:50:00,864 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:50:00,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00 WrapperNode [2022-11-21 16:50:00,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:50:00,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:50:00,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:50:00,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:50:00,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,944 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2022-11-21 16:50:00,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:50:00,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:50:00,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:50:00,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:50:00,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:00,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:01,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:01,001 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:01,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:01,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:50:01,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:50:01,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:50:01,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:50:01,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (1/1) ... [2022-11-21 16:50:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:01,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:01,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 16:50:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:50:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:50:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:50:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:50:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:50:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:50:01,255 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:50:01,257 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:50:01,441 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:50:01,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:50:01,449 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:50:01,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:01 BoogieIcfgContainer [2022-11-21 16:50:01,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:50:01,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 16:50:01,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 16:50:01,458 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 16:50:01,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:01,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 04:50:00" (1/3) ... [2022-11-21 16:50:01,461 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d08fb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:50:01, skipping insertion in model container [2022-11-21 16:50:01,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:01,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:00" (2/3) ... [2022-11-21 16:50:01,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d08fb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:50:01, skipping insertion in model container [2022-11-21 16:50:01,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:01,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:01" (3/3) ... [2022-11-21 16:50:01,464 INFO L332 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2022-11-21 16:50:01,535 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 16:50:01,535 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 16:50:01,535 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 16:50:01,536 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 16:50:01,536 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 16:50:01,536 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 16:50:01,536 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 16:50:01,536 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 16:50:01,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 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-21 16:50:01,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-21 16:50:01,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:01,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:01,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:01,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-21 16:50:01,578 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 16:50:01,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 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-21 16:50:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-21 16:50:01,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:01,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:01,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:01,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-21 16:50:01,592 INFO L748 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 12#L559-4true [2022-11-21 16:50:01,593 INFO L750 eck$LassoCheckResult]: Loop: 12#L559-4true call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 11#L553-1true assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 6#L553-3true assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 17#L554true assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 5#L555-3true assume !true; 12#L559-4true [2022-11-21 16:50:01,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-21 16:50:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:01,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967002200] [2022-11-21 16:50:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:01,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:01,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 35409690, now seen corresponding path program 1 times [2022-11-21 16:50:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:01,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337382760] [2022-11-21 16:50:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:01,996 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-21 16:50:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:01,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337382760] [2022-11-21 16:50:01,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337382760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:01,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:01,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:50:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370680244] [2022-11-21 16:50:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:02,004 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:50:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:50:02,076 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 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) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 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-21 16:50:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:02,086 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-11-21 16:50:02,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2022-11-21 16:50:02,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-21 16:50:02,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2022-11-21 16:50:02,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-21 16:50:02,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-21 16:50:02,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2022-11-21 16:50:02,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:02,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-11-21 16:50:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2022-11-21 16:50:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-21 16:50:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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-21 16:50:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2022-11-21 16:50:02,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-11-21 16:50:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:50:02,145 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-11-21 16:50:02,145 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 16:50:02,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2022-11-21 16:50:02,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-21 16:50:02,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:02,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:02,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:02,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:50:02,149 INFO L748 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 50#L559-4 [2022-11-21 16:50:02,149 INFO L750 eck$LassoCheckResult]: Loop: 50#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 51#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 46#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 47#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 48#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 49#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 50#L559-4 [2022-11-21 16:50:02,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-21 16:50:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260849569] [2022-11-21 16:50:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:02,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:02,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:02,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2022-11-21 16:50:02,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:02,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105767645] [2022-11-21 16:50:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,460 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-21 16:50:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:02,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105767645] [2022-11-21 16:50:02,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105767645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:02,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:02,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:50:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324024923] [2022-11-21 16:50:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:02,463 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:02,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:50:02,464 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-21 16:50:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:02,581 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-11-21 16:50:02,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2022-11-21 16:50:02,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-11-21 16:50:02,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2022-11-21 16:50:02,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-21 16:50:02,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-11-21 16:50:02,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-11-21 16:50:02,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:02,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-11-21 16:50:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-11-21 16:50:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2022-11-21 16:50:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-21 16:50:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-21 16:50:02,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-21 16:50:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:50:02,588 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-21 16:50:02,591 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 16:50:02,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-21 16:50:02,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-11-21 16:50:02,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:02,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:02,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:02,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:50:02,594 INFO L748 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 89#L559-4 [2022-11-21 16:50:02,596 INFO L750 eck$LassoCheckResult]: Loop: 89#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 88#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 83#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 84#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 81#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 82#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 89#L559-4 [2022-11-21 16:50:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-21 16:50:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:02,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785867457] [2022-11-21 16:50:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:02,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:02,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2022-11-21 16:50:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:02,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624767902] [2022-11-21 16:50:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,875 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-21 16:50:02,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624767902] [2022-11-21 16:50:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624767902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:02,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:50:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560254612] [2022-11-21 16:50:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:02,907 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:50:02,908 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-21 16:50:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:02,995 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-11-21 16:50:02,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-11-21 16:50:02,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-21 16:50:02,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-11-21 16:50:02,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-11-21 16:50:02,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-11-21 16:50:02,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-11-21 16:50:02,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:02,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-21 16:50:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-11-21 16:50:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-11-21 16:50:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-21 16:50:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-11-21 16:50:02,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-21 16:50:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:50:03,003 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-21 16:50:03,004 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 16:50:03,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-11-21 16:50:03,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-21 16:50:03,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:03,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:03,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:03,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:03,007 INFO L748 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 125#L559-4 [2022-11-21 16:50:03,007 INFO L750 eck$LassoCheckResult]: Loop: 125#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 126#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 120#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 121#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 118#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 119#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 127#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 125#L559-4 [2022-11-21 16:50:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-21 16:50:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:03,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176963724] [2022-11-21 16:50:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:03,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:03,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2022-11-21 16:50:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:03,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983396370] [2022-11-21 16:50:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:03,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:03,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983396370] [2022-11-21 16:50:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983396370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863368971] [2022-11-21 16:50:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:03,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:50:03,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:50:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:03,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:50:03,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:03,686 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-11-21 16:50:03,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-11-21 16:50:03,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:50:03,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 63 [2022-11-21 16:50:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:03,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:50:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:04,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863368971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:50:04,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:50:04,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-21 16:50:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036839441] [2022-11-21 16:50:04,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:50:04,093 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:50:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:50:04,097 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-21 16:50:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:04,373 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-11-21 16:50:04,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2022-11-21 16:50:04,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-11-21 16:50:04,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2022-11-21 16:50:04,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-11-21 16:50:04,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-11-21 16:50:04,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-11-21 16:50:04,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:04,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-21 16:50:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-11-21 16:50:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-21 16:50:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-21 16:50:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-21 16:50:04,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-21 16:50:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:50:04,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-21 16:50:04,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 16:50:04,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-11-21 16:50:04,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-11-21 16:50:04,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:04,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:04,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-21 16:50:04,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:04,382 INFO L748 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 222#L559-4 [2022-11-21 16:50:04,382 INFO L750 eck$LassoCheckResult]: Loop: 222#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 223#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 217#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 218#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 219#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 220#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 221#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 225#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 222#L559-4 [2022-11-21 16:50:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-21 16:50:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:04,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407931268] [2022-11-21 16:50:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2022-11-21 16:50:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:04,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496212421] [2022-11-21 16:50:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2022-11-21 16:50:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373517260] [2022-11-21 16:50:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:04,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:05,354 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:50:05,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:50:05,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:50:05,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:50:05,355 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 16:50:05,355 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:05,355 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:50:05,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:50:05,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration5_Lasso [2022-11-21 16:50:05,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:50:05,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:50:05,382 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-21 16:50:05,806 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-21 16:50:05,811 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-21 16:50:05,814 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-21 16:50:05,818 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-21 16:50:05,822 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-21 16:50:05,825 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-21 16:50:05,828 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-21 16:50:05,832 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-21 16:50:05,835 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-21 16:50:05,839 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-21 16:50:05,842 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-21 16:50:05,846 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-21 16:50:05,849 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-21 16:50:05,853 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-21 16:50:05,857 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-21 16:50:05,861 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-21 16:50:05,865 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-21 16:50:05,869 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-21 16:50:05,875 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-21 16:50:05,878 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-21 16:50:05,881 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-21 16:50:05,885 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-21 16:50:05,888 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-21 16:50:06,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:50:06,401 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 16:50:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:06,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:06,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:06,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:06,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-21 16:50:06,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:06,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:06,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:06,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:06,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:06,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:06,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:06,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:06,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:06,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:06,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-21 16:50:06,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:06,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:06,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:06,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:06,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:06,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:06,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:06,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:06,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:06,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:06,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:06,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-21 16:50:06,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:06,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:06,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:06,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:06,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:06,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:06,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 16:50:06,645 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 16:50:06,646 INFO L444 ModelExtractionUtils]: 11 out of 28 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-11-21 16:50:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:06,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:06,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-21 16:50:06,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 16:50:06,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-21 16:50:06,710 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 16:50:06,711 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_1 Supporting invariants [] [2022-11-21 16:50:06,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:06,788 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-11-21 16:50:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:06,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:50:06,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:06,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:50:06,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:06,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:50:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:50:06,957 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-11-21 16:50:06,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-21 16:50:07,139 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) Result 40 states and 53 transitions. Complement of second has 10 states. [2022-11-21 16:50:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-11-21 16:50:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-21 16:50:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-11-21 16:50:07,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2022-11-21 16:50:07,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:07,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2022-11-21 16:50:07,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:07,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2022-11-21 16:50:07,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:07,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2022-11-21 16:50:07,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-11-21 16:50:07,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2022-11-21 16:50:07,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-21 16:50:07,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-21 16:50:07,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2022-11-21 16:50:07,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 16:50:07,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-11-21 16:50:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2022-11-21 16:50:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-11-21 16:50:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 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-21 16:50:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-11-21 16:50:07,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-11-21 16:50:07,175 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-11-21 16:50:07,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 16:50:07,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2022-11-21 16:50:07,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-11-21 16:50:07,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:07,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:07,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-11-21 16:50:07,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2022-11-21 16:50:07,180 INFO L748 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 396#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 394#L553-1 [2022-11-21 16:50:07,180 INFO L750 eck$LassoCheckResult]: Loop: 394#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 382#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 383#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 399#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 397#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 378#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 379#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 405#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 404#L555-1 assume !(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1; 390#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 394#L553-1 [2022-11-21 16:50:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-11-21 16:50:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:07,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398093110] [2022-11-21 16:50:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:07,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2022-11-21 16:50:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:07,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952652111] [2022-11-21 16:50:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2022-11-21 16:50:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756557336] [2022-11-21 16:50:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:07,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:08,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-11-21 16:50:08,250 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:50:08,250 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:50:08,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:50:08,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:50:08,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 16:50:08,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:08,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:50:08,251 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:50:08,251 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2022-11-21 16:50:08,251 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:50:08,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:50:08,256 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-21 16:50:08,265 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-21 16:50:08,268 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-21 16:50:08,764 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-21 16:50:08,767 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-21 16:50:08,770 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-21 16:50:08,772 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-21 16:50:08,775 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-21 16:50:08,779 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-21 16:50:08,781 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-21 16:50:08,783 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-21 16:50:08,786 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-21 16:50:08,789 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-21 16:50:08,791 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-21 16:50:08,796 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-21 16:50:08,800 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-21 16:50:08,802 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-21 16:50:08,805 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-21 16:50:08,810 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-21 16:50:08,814 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-21 16:50:08,820 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-21 16:50:08,823 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-21 16:50:09,437 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:50:09,437 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 16:50:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-21 16:50:09,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:50:09,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:50:09,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:50:09,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-21 16:50:09,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:50:09,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:50:09,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:50:09,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-21 16:50:09,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:09,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:09,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-21 16:50:09,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:09,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:09,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,616 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-21 16:50:09,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:09,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:09,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-11-21 16:50:09,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,657 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-21 16:50:09,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:09,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:09,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:09,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:09,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-21 16:50:09,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:09,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:09,739 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-11-21 16:50:09,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:09,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:09,756 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-11-21 16:50:09,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:09,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 16:50:09,802 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-11-21 16:50:09,802 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-11-21 16:50:09,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:09,804 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:09,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 16:50:09,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-21 16:50:09,835 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-21 16:50:09,835 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 16:50:09,835 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6#1 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6#1 1 0)_2 Supporting invariants [] [2022-11-21 16:50:09,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:09,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-11-21 16:50:09,897 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-11-21 16:50:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:09,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:50:09,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:09,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:50:09,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:50:10,028 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-11-21 16:50:10,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 16:50:10,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Result 73 states and 98 transitions. Complement of second has 10 states. [2022-11-21 16:50:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-11-21 16:50:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 16:50:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-11-21 16:50:10,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 10 letters. [2022-11-21 16:50:10,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:10,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 10 letters. [2022-11-21 16:50:10,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:10,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 20 letters. [2022-11-21 16:50:10,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:10,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 98 transitions. [2022-11-21 16:50:10,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-21 16:50:10,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 89 transitions. [2022-11-21 16:50:10,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-21 16:50:10,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-21 16:50:10,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 89 transitions. [2022-11-21 16:50:10,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 16:50:10,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 89 transitions. [2022-11-21 16:50:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 89 transitions. [2022-11-21 16:50:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-11-21 16:50:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 54 states have internal predecessors, (79), 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-21 16:50:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2022-11-21 16:50:10,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 79 transitions. [2022-11-21 16:50:10,169 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2022-11-21 16:50:10,169 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 16:50:10,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2022-11-21 16:50:10,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-21 16:50:10,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:10,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:10,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:50:10,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-21 16:50:10,173 INFO L748 eck$LassoCheckResult]: Stem: 592#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 612#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 634#L553-1 assume !test_fun_#t~short6#1; 598#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 599#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 594#L555-3 [2022-11-21 16:50:10,174 INFO L750 eck$LassoCheckResult]: Loop: 594#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 595#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 594#L555-3 [2022-11-21 16:50:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2022-11-21 16:50:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:10,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696197911] [2022-11-21 16:50:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:10,219 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-21 16:50:10,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696197911] [2022-11-21 16:50:10,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696197911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:10,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:10,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:50:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798608172] [2022-11-21 16:50:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:10,221 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:50:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2022-11-21 16:50:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:10,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551665309] [2022-11-21 16:50:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:10,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:10,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:50:10,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:50:10,281 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 16:50:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:10,295 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-11-21 16:50:10,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2022-11-21 16:50:10,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-21 16:50:10,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 53 states and 67 transitions. [2022-11-21 16:50:10,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-11-21 16:50:10,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-11-21 16:50:10,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2022-11-21 16:50:10,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 16:50:10,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-21 16:50:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2022-11-21 16:50:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-21 16:50:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 52 states have internal predecessors, (67), 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-21 16:50:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-21 16:50:10,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-21 16:50:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:50:10,304 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-21 16:50:10,304 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 16:50:10,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2022-11-21 16:50:10,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-21 16:50:10,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:10,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:10,306 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:50:10,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-21 16:50:10,306 INFO L748 eck$LassoCheckResult]: Stem: 712#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 728#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 758#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 718#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 719#L554 assume test_fun_#t~mem7#1 > test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 714#L555-3 [2022-11-21 16:50:10,307 INFO L750 eck$LassoCheckResult]: Loop: 714#L555-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4); 715#L555-1 assume !!(test_fun_#t~mem9#1 > 0);havoc test_fun_#t~mem9#1;call test_fun_#t~mem10#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem10#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem10#1; 714#L555-3 [2022-11-21 16:50:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2022-11-21 16:50:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:10,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855629569] [2022-11-21 16:50:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2022-11-21 16:50:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:10,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825363095] [2022-11-21 16:50:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:10,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2022-11-21 16:50:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244050147] [2022-11-21 16:50:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:10,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:11,003 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:50:11,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:50:11,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:50:11,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:50:11,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 16:50:11,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:11,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:50:11,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:50:11,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2022-11-21 16:50:11,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:50:11,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:50:11,008 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-21 16:50:11,013 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-21 16:50:11,319 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-21 16:50:11,323 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-21 16:50:11,325 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-21 16:50:11,329 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-21 16:50:11,333 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-21 16:50:11,336 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-21 16:50:11,339 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-21 16:50:11,342 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-21 16:50:11,345 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-21 16:50:11,349 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-21 16:50:11,353 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-21 16:50:11,355 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-21 16:50:11,358 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-21 16:50:11,360 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-21 16:50:11,363 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-21 16:50:11,366 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-21 16:50:11,373 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-21 16:50:11,376 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-21 16:50:11,379 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-21 16:50:11,381 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-21 16:50:11,384 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-21 16:50:11,388 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-21 16:50:11,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:50:11,758 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 16:50:11,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:11,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:11,763 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:11,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-21 16:50:11,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:11,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:11,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:50:11,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:11,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:11,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:11,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:50:11,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:50:11,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:11,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:11,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:11,839 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:11,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:11,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-21 16:50:11,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:11,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:11,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:11,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:11,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:11,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:11,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:11,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:11,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:11,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:11,906 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:11,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:11,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-21 16:50:11,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:11,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:11,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:11,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:11,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:11,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:11,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 16:50:11,986 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-21 16:50:11,986 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-11-21 16:50:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:11,988 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:12,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 16:50:12,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-21 16:50:12,032 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-21 16:50:12,032 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 16:50:12,032 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 Supporting invariants [] [2022-11-21 16:50:12,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:12,071 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-11-21 16:50:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:12,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:50:12,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:12,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:50:12,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:12,154 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-21 16:50:12,155 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-21 16:50:12,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 16:50:12,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Result 149 states and 188 transitions. Complement of second has 6 states. [2022-11-21 16:50:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-21 16:50:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 16:50:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-11-21 16:50:12,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-21 16:50:12,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:12,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-21 16:50:12,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:12,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2022-11-21 16:50:12,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:12,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2022-11-21 16:50:12,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-21 16:50:12,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2022-11-21 16:50:12,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-11-21 16:50:12,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-11-21 16:50:12,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2022-11-21 16:50:12,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 16:50:12,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-21 16:50:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2022-11-21 16:50:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2022-11-21 16:50:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 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-21 16:50:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-11-21 16:50:12,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-11-21 16:50:12,219 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-11-21 16:50:12,219 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-21 16:50:12,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2022-11-21 16:50:12,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-21 16:50:12,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:12,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:12,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:12,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-21 16:50:12,222 INFO L748 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1004#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1005#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1015#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1014#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1013#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1012#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1010#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 999#L559-1 [2022-11-21 16:50:12,222 INFO L750 eck$LassoCheckResult]: Loop: 999#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 998#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 999#L559-1 [2022-11-21 16:50:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2022-11-21 16:50:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897263862] [2022-11-21 16:50:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:12,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2022-11-21 16:50:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:12,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369257820] [2022-11-21 16:50:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2022-11-21 16:50:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871305897] [2022-11-21 16:50:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:12,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:12,998 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:50:12,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:50:12,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:50:12,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:50:12,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 16:50:12,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:13,000 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:50:13,000 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:50:13,000 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2022-11-21 16:50:13,000 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:50:13,000 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:50:13,004 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-21 16:50:13,342 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-21 16:50:13,344 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-21 16:50:13,347 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-21 16:50:13,350 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-21 16:50:13,357 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-21 16:50:13,359 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-21 16:50:13,362 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-21 16:50:13,365 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-21 16:50:13,368 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-21 16:50:13,371 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-21 16:50:13,373 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-21 16:50:13,377 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-21 16:50:13,380 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-21 16:50:13,383 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-21 16:50:13,385 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-21 16:50:13,393 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-21 16:50:13,396 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-21 16:50:13,398 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-21 16:50:13,402 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-21 16:50:13,404 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-21 16:50:13,407 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-21 16:50:13,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:50:13,762 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 16:50:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:13,764 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:13,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-21 16:50:13,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:13,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:13,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:13,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:13,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:13,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:13,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:13,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:13,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:13,819 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:13,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-11-21 16:50:13,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-21 16:50:13,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:13,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:13,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:13,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:13,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:13,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:13,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:13,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:50:13,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-11-21 16:50:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:13,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:13,901 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:13,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-21 16:50:13,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:50:13,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:50:13,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:50:13,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:50:13,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:50:13,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-21 16:50:13,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-21 16:50:13,966 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 16:50:13,989 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-11-21 16:50:13,989 INFO L444 ModelExtractionUtils]: 8 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-11-21 16:50:13,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:13,991 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:14,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 16:50:14,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-21 16:50:14,018 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-21 16:50:14,019 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 16:50:14,019 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem11#1) = 1*ULTIMATE.start_test_fun_#t~mem11#1 Supporting invariants [1*ULTIMATE.start_test_fun_#t~mem11#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_4 >= 0] [2022-11-21 16:50:14,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:14,072 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-11-21 16:50:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:14,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:50:14,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:14,165 WARN L261 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:50:14,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:14,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 16:50:14,203 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-21 16:50:14,203 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-21 16:50:14,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 16:50:14,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Result 61 states and 76 transitions. Complement of second has 5 states. [2022-11-21 16:50:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-21 16:50:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 16:50:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-11-21 16:50:14,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2022-11-21 16:50:14,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:14,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2022-11-21 16:50:14,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:14,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2022-11-21 16:50:14,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:50:14,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2022-11-21 16:50:14,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-21 16:50:14,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 66 transitions. [2022-11-21 16:50:14,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-11-21 16:50:14,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-11-21 16:50:14,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2022-11-21 16:50:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-21 16:50:14,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-11-21 16:50:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2022-11-21 16:50:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-11-21 16:50:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 46 states have internal predecessors, (57), 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-21 16:50:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-11-21 16:50:14,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-11-21 16:50:14,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-11-21 16:50:14,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-21 16:50:14,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2022-11-21 16:50:14,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-21 16:50:14,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:14,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:14,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2022-11-21 16:50:14,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-21 16:50:14,254 INFO L748 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet18#1, main_#t~nondet19#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~mem7#1, test_fun_#t~mem8#1, test_fun_#t~mem10#1, test_fun_#t~mem9#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~mem4#1, test_fun_#t~mem5#1, test_fun_#t~short6#1, test_fun_#t~mem13#1, test_fun_#t~mem14#1, test_fun_#t~short15#1, test_fun_#t~mem16#1, test_fun_#t~mem17#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1190#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1191#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1222#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1194#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1186#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1187#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1188#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1196#L559-1 assume !(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1; 1202#L559-4 call test_fun_#t~mem4#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem4#1 > 0; 1201#L553-1 assume test_fun_#t~short6#1;call test_fun_#t~mem5#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short6#1 := test_fun_#t~mem5#1 > 0; 1200#L553-3 assume !!test_fun_#t~short6#1;havoc test_fun_#t~mem4#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~short6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem8#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1199#L554 assume !(test_fun_#t~mem7#1 > test_fun_#t~mem8#1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem8#1; 1198#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1197#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1195#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1185#L559-1 [2022-11-21 16:50:14,254 INFO L750 eck$LassoCheckResult]: Loop: 1185#L559-1 assume !!(test_fun_#t~mem11#1 > 0);havoc test_fun_#t~mem11#1;call test_fun_#t~mem12#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1184#L559-3 call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1185#L559-1 [2022-11-21 16:50:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2022-11-21 16:50:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:14,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768388763] [2022-11-21 16:50:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:50:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768388763] [2022-11-21 16:50:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768388763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:14,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:14,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:50:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117719502] [2022-11-21 16:50:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:14,357 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:50:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2022-11-21 16:50:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:14,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744895285] [2022-11-21 16:50:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:14,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:14,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:50:14,417 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 16:50:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:14,461 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-21 16:50:14,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2022-11-21 16:50:14,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-21 16:50:14,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2022-11-21 16:50:14,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-21 16:50:14,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-21 16:50:14,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-21 16:50:14,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:14,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:50:14,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:50:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:50:14,463 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:50:14,463 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-21 16:50:14,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:50:14,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-21 16:50:14,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-21 16:50:14,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 04:50:14 BoogieIcfgContainer [2022-11-21 16:50:14,471 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-21 16:50:14,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:50:14,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:50:14,472 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:50:14,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:01" (3/4) ... [2022-11-21 16:50:14,476 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:50:14,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:50:14,477 INFO L158 Benchmark]: Toolchain (without parser) took 14159.92ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 142.2MB in the beginning and 124.4MB in the end (delta: 17.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,478 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:50:14,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.39ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 126.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.40ms. Allocated memory is still 176.2MB. Free memory was 126.4MB in the beginning and 124.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,479 INFO L158 Benchmark]: Boogie Preprocessor took 66.50ms. Allocated memory is still 176.2MB. Free memory was 124.7MB in the beginning and 123.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,479 INFO L158 Benchmark]: RCFGBuilder took 438.00ms. Allocated memory is still 176.2MB. Free memory was 123.5MB in the beginning and 109.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,480 INFO L158 Benchmark]: BuchiAutomizer took 13017.99ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 109.7MB in the beginning and 125.4MB in the end (delta: -15.8MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-11-21 16:50:14,480 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 211.8MB. Free memory was 125.4MB in the beginning and 124.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:50:14,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.39ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 126.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.40ms. Allocated memory is still 176.2MB. Free memory was 126.4MB in the beginning and 124.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.50ms. Allocated memory is still 176.2MB. Free memory was 124.7MB in the beginning and 123.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.00ms. Allocated memory is still 176.2MB. Free memory was 123.5MB in the beginning and 109.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13017.99ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 109.7MB in the beginning and 125.4MB in the end (delta: -15.8MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 211.8MB. Free memory was 125.4MB in the beginning and 124.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2fbe6d7b and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.9s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 11.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 117 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax108 hnf100 lsp87 ukn68 mio100 lsp36 div100 bol103 ite100 ukn100 eq180 hnf89 smp96 dnf111 smp100 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 120ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-21 16:50:14,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:14,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:14,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dae908ea-bc67-4b64-bd51-d7f75b2fb806/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE