./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8 --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 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- 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-2329fc7 [2022-12-13 13:16:45,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:16:45,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:16:45,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:16:45,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:16:45,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:16:45,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:16:45,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:16:45,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:16:45,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:16:45,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:16:45,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:16:45,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:16:45,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:16:45,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:16:45,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:16:45,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:16:45,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:16:45,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:16:45,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:16:45,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:16:46,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:16:46,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:16:46,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:16:46,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:16:46,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:16:46,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:16:46,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:16:46,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:16:46,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:16:46,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:16:46,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:16:46,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:16:46,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:16:46,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:16:46,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:16:46,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:16:46,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:16:46,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:16:46,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:16:46,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:16:46,014 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 13:16:46,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:16:46,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:16:46,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:16:46,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:16:46,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:16:46,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:16:46,039 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:16:46,039 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 13:16:46,039 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 13:16:46,039 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 13:16:46,039 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 13:16:46,039 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 13:16:46,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 13:16:46,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 13:16:46,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:16:46,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:16:46,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:16:46,042 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 13:16:46,042 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_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/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_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8 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 -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2022-12-13 13:16:46,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:16:46,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:16:46,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:16:46,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:16:46,236 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:16:46,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2022-12-13 13:16:48,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:16:48,936 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:16:48,936 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2022-12-13 13:16:48,946 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/data/aa45a6e83/e214c8ca8967468983b852295b1341df/FLAG21c2aee4e [2022-12-13 13:16:48,961 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/data/aa45a6e83/e214c8ca8967468983b852295b1341df [2022-12-13 13:16:48,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:16:48,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:16:48,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:48,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:16:48,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:16:48,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:48" (1/1) ... [2022-12-13 13:16:48,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48eb54d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:48, skipping insertion in model container [2022-12-13 13:16:48,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:48" (1/1) ... [2022-12-13 13:16:48,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:16:49,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:16:49,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:49,204 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:16:49,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:49,243 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:16:49,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49 WrapperNode [2022-12-13 13:16:49,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:49,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:49,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:16:49,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:16:49,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,270 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-12-13 13:16:49,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:49,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:16:49,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:16:49,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:16:49,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:16:49,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:16:49,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:16:49,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:16:49,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (1/1) ... [2022-12-13 13:16:49,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:49,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:49,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 13:16:49,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:16:49,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:16:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:16:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:16:49,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:16:49,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:16:49,431 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:16:49,432 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:16:49,558 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:16:49,564 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:16:49,564 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:16:49,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:49 BoogieIcfgContainer [2022-12-13 13:16:49,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:16:49,567 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 13:16:49,567 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 13:16:49,571 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 13:16:49,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:16:49,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 01:16:48" (1/3) ... [2022-12-13 13:16:49,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258012a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:16:49, skipping insertion in model container [2022-12-13 13:16:49,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:16:49,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:49" (2/3) ... [2022-12-13 13:16:49,574 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258012a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:16:49, skipping insertion in model container [2022-12-13 13:16:49,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:16:49,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:49" (3/3) ... [2022-12-13 13:16:49,575 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2022-12-13 13:16:49,629 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 13:16:49,629 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 13:16:49,629 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 13:16:49,629 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 13:16:49,629 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 13:16:49,629 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 13:16:49,630 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 13:16:49,630 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 13:16:49,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-12-13 13:16:49,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:49,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:49,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:49,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:16:49,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 13:16:49,657 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 13:16:49,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-12-13 13:16:49,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:49,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:49,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:49,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:16:49,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 13:16:49,666 INFO L748 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3#L555-3true [2022-12-13 13:16:49,667 INFO L750 eck$LassoCheckResult]: Loop: 3#L555-3true call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 10#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 8#L557-3true assume !true; 12#L557-4true call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3#L555-3true [2022-12-13 13:16:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 13:16:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401368603] [2022-12-13 13:16:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:49,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:49,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-12-13 13:16:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:49,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555293672] [2022-12-13 13:16:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555293672] [2022-12-13 13:16:49,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555293672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:49,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:49,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:16:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651009943] [2022-12-13 13:16:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:49,924 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 13:16:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:16:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:16:49,956 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-12-13 13:16:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:16:49,962 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-12-13 13:16:49,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-12-13 13:16:49,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:49,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2022-12-13 13:16:49,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-12-13 13:16:49,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-12-13 13:16:49,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-12-13 13:16:49,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:49,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 13:16:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-12-13 13:16:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-12-13 13:16:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-12-13 13:16:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-12-13 13:16:49,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 13:16:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:16:49,996 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 13:16:49,996 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 13:16:49,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-12-13 13:16:49,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:49,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:49,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:49,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 13:16:49,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 13:16:49,998 INFO L748 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 32#L555-3 [2022-12-13 13:16:49,998 INFO L750 eck$LassoCheckResult]: Loop: 32#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 33#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 36#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 38#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 32#L555-3 [2022-12-13 13:16:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 13:16:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:50,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338518631] [2022-12-13 13:16:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-12-13 13:16:50,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:50,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174781668] [2022-12-13 13:16:50,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2022-12-13 13:16:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:50,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423322550] [2022-12-13 13:16:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:50,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:50,847 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:16:50,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:16:50,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:16:50,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:16:50,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:16:50,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:50,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:16:50,848 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:16:50,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2022-12-13 13:16:50,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:16:50,848 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:16:50,862 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,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-12-13 13:16:50,871 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,873 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,874 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,876 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,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-12-13 13:16:50,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,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-12-13 13:16:50,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:50,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-12-13 13:16:51,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:51,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:51,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:51,523 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:16:51,526 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:16:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 13:16:51,530 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-12-13 13:16:51,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:51,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 13:16:51,552 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-12-13 13:16:51,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 13:16:51,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 13:16:51,573 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-12-13 13:16:51,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 13:16:51,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 13:16:51,591 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-12-13 13:16:51,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:51,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 13:16:51,613 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-12-13 13:16:51,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 13:16:51,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 13:16:51,631 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-12-13 13:16:51,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 13:16:51,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 13:16:51,657 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-12-13 13:16:51,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:51,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 13:16:51,676 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-12-13 13:16:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 13:16:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 13:16:51,698 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-12-13 13:16:51,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 13:16:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 13:16:51,717 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-12-13 13:16:51,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 13:16:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,734 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 13:16:51,736 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-12-13 13:16:51,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 13:16:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,754 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 13:16:51,757 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-12-13 13:16:51,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:51,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:51,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:51,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 13:16:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 13:16:51,774 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-12-13 13:16:51,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 13:16:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,797 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 13:16:51,799 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-12-13 13:16:51,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 13:16:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,832 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 13:16:51,834 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-12-13 13:16:51,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,856 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 13:16:51,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-12-13 13:16:51,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 13:16:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,878 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 13:16:51,880 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-12-13 13:16:51,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-12-13 13:16:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,907 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 13:16:51,909 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-12-13 13:16:51,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-12-13 13:16:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,929 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 13:16:51,931 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-12-13 13:16:51,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 13:16:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,949 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 13:16:51,952 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-12-13 13:16:51,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:51,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 13:16:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:51,976 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:51,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 13:16:51,978 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-12-13 13:16:51,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:51,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:51,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:51,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:51,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:51,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:51,997 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:16:52,010 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-12-13 13:16:52,010 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-12-13 13:16:52,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:52,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:52,033 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:52,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 13:16:52,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:16:52,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:16:52,046 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:16:52,047 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-12-13 13:16:52,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 13:16:52,122 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-12-13 13:16:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:52,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:16:52,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:52,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:16:52,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:52,236 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:16:52,237 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 1 case distinctions, treesize of input 30 treesize of output 33 [2022-12-13 13:16:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:52,397 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-12-13 13:16:52,399 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-12-13 13:16:52,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 11 states. [2022-12-13 13:16:52,580 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-12-13 13:16:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-12-13 13:16:52,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2022-12-13 13:16:52,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:52,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2022-12-13 13:16:52,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:52,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2022-12-13 13:16:52,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:52,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-12-13 13:16:52,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:52,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2022-12-13 13:16:52,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-12-13 13:16:52,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-12-13 13:16:52,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-12-13 13:16:52,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:16:52,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 13:16:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-12-13 13:16:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-13 13:16:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-12-13 13:16:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-12-13 13:16:52,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 13:16:52,584 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 13:16:52,584 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 13:16:52,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-12-13 13:16:52,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:52,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:52,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:52,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:16:52,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:16:52,585 INFO L748 eck$LassoCheckResult]: Stem: 196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 202#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 195#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 198#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 199#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 203#L557-3 [2022-12-13 13:16:52,585 INFO L750 eck$LassoCheckResult]: Loop: 203#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 206#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 203#L557-3 [2022-12-13 13:16:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-12-13 13:16:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:52,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296183285] [2022-12-13 13:16:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-12-13 13:16:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:52,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377079837] [2022-12-13 13:16:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2022-12-13 13:16:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:52,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905371677] [2022-12-13 13:16:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:52,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:53,665 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:16:53,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:16:53,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:16:53,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:16:53,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:16:53,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:53,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:16:53,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:16:53,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2022-12-13 13:16:53,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:16:53,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:16:53,667 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,669 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,673 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,676 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:53,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,069 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,072 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,073 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,074 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,076 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:54,335 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:16:54,335 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:16:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,336 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 13:16:54,338 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-12-13 13:16:54,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,353 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 13:16:54,355 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-12-13 13:16:54,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,373 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 13:16:54,375 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-12-13 13:16:54,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-12-13 13:16:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,390 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 13:16:54,392 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-12-13 13:16:54,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-12-13 13:16:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,410 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 13:16:54,413 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-12-13 13:16:54,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,428 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 13:16:54,430 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-12-13 13:16:54,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-12-13 13:16:54,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,445 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 13:16:54,447 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-12-13 13:16:54,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-12-13 13:16:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,464 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 13:16:54,466 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-12-13 13:16:54,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,481 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 13:16:54,483 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-12-13 13:16:54,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:54,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:54,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:54,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,499 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 13:16:54,501 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-12-13 13:16:54,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,521 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 13:16:54,523 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-12-13 13:16:54,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-12-13 13:16:54,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,540 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 13:16:54,542 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-12-13 13:16:54,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:54,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-12-13 13:16:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,560 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 13:16:54,562 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-12-13 13:16:54,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:54,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:54,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:54,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:54,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:54,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:54,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:16:54,591 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-12-13 13:16:54,591 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-12-13 13:16:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:54,593 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:54,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-12-13 13:16:54,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:16:54,605 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:16:54,605 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:16:54,605 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 Supporting invariants [] [2022-12-13 13:16:54,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-12-13 13:16:54,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:54,685 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-12-13 13:16:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:54,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:16:54,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:54,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:16:54,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:54,738 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-12-13 13:16:54,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 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-12-13 13:16:54,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. 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 26 states and 31 transitions. Complement of second has 7 states. [2022-12-13 13:16:54,758 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-12-13 13:16:54,758 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-12-13 13:16:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-12-13 13:16:54,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2022-12-13 13:16:54,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:54,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2022-12-13 13:16:54,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:54,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2022-12-13 13:16:54,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:54,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2022-12-13 13:16:54,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:54,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2022-12-13 13:16:54,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-12-13 13:16:54,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-12-13 13:16:54,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-12-13 13:16:54,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:16:54,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-12-13 13:16:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-12-13 13:16:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-12-13 13:16:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-12-13 13:16:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-12-13 13:16:54,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-12-13 13:16:54,763 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-12-13 13:16:54,763 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 13:16:54,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-12-13 13:16:54,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:54,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:54,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:54,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:54,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 13:16:54,764 INFO L748 eck$LassoCheckResult]: Stem: 377#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 384#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 376#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 391#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 390#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 389#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 383#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 385#L557-4 [2022-12-13 13:16:54,764 INFO L750 eck$LassoCheckResult]: Loop: 385#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 372#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 373#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 379#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 380#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 385#L557-4 [2022-12-13 13:16:54,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2022-12-13 13:16:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5136368] [2022-12-13 13:16:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2022-12-13 13:16:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112710176] [2022-12-13 13:16:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2022-12-13 13:16:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:54,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624571275] [2022-12-13 13:16:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:54,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:55,878 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:16:55,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:16:55,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:16:55,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:16:55,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:16:55,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:55,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:16:55,879 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:16:55,879 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration4_Lasso [2022-12-13 13:16:55,879 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:16:55,879 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:16:55,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,894 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,899 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:55,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:16:56,526 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:16:56,526 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:16:56,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,527 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-12-13 13:16:56,529 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-12-13 13:16:56,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-12-13 13:16:56,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,546 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-12-13 13:16:56,548 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-12-13 13:16:56,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:56,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:56,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:56,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,563 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-12-13 13:16:56,565 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-12-13 13:16:56,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,582 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-12-13 13:16:56,584 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-12-13 13:16:56,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,601 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-12-13 13:16:56,603 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-12-13 13:16:56,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:56,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:56,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:56,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-12-13 13:16:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,618 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-12-13 13:16:56,620 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-12-13 13:16:56,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:56,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:56,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:56,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-12-13 13:16:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,639 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-12-13 13:16:56,641 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-12-13 13:16:56,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:56,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:56,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:56,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,656 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-12-13 13:16:56,658 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-12-13 13:16:56,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-12-13 13:16:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,675 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-12-13 13:16:56,678 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-12-13 13:16:56,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-12-13 13:16:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,694 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-12-13 13:16:56,696 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-12-13 13:16:56,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:16:56,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:16:56,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:16:56,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,711 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-12-13 13:16:56,713 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-12-13 13:16:56,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-12-13 13:16:56,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,730 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-12-13 13:16:56,731 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-12-13 13:16:56,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,764 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-12-13 13:16:56,766 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-12-13 13:16:56,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-12-13 13:16:56,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,787 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-12-13 13:16:56,790 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-12-13 13:16:56,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:16:56,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-12-13 13:16:56,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,809 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-12-13 13:16:56,812 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-12-13 13:16:56,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:16:56,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:16:56,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:16:56,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:16:56,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:16:56,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:16:56,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:16:56,839 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-12-13 13:16:56,839 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-12-13 13:16:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:16:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:56,840 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:56,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-12-13 13:16:56,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:16:56,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:16:56,854 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:16:56,854 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 Supporting invariants [] [2022-12-13 13:16:56,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-12-13 13:16:56,929 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-12-13 13:16:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:56,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:16:56,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:56,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:16:56,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:56,974 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-12-13 13:16:57,004 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:16:57,005 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 1 case distinctions, treesize of input 28 treesize of output 31 [2022-12-13 13:16:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:57,079 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-12-13 13:16:57,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-12-13 13:16:57,107 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 48 states and 58 transitions. Complement of second has 9 states. [2022-12-13 13:16:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-12-13 13:16:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-12-13 13:16:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-12-13 13:16:57,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2022-12-13 13:16:57,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:57,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2022-12-13 13:16:57,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:57,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2022-12-13 13:16:57,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:16:57,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2022-12-13 13:16:57,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:57,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2022-12-13 13:16:57,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-12-13 13:16:57,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-12-13 13:16:57,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2022-12-13 13:16:57,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:16:57,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-12-13 13:16:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2022-12-13 13:16:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-12-13 13:16:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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-12-13 13:16:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-12-13 13:16:57,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-12-13 13:16:57,112 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-12-13 13:16:57,112 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 13:16:57,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2022-12-13 13:16:57,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 13:16:57,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:16:57,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:16:57,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 13:16:57,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:16:57,113 INFO L748 eck$LassoCheckResult]: Stem: 604#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 605#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 610#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 625#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 624#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 623#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 622#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 619#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 617#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 602#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 603#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 629#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 630#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 613#L557-3 [2022-12-13 13:16:57,113 INFO L750 eck$LassoCheckResult]: Loop: 613#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 631#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 613#L557-3 [2022-12-13 13:16:57,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 2 times [2022-12-13 13:16:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:57,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107230012] [2022-12-13 13:16:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:57,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-12-13 13:16:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:57,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:57,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107230012] [2022-12-13 13:16:57,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107230012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:57,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093645290] [2022-12-13 13:16:57,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:16:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:57,478 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:57,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 13:16:57,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:16:57,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:16:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:16:57,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:57,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:16:57,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:16:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:16:57,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:16:57,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:16:57,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:16:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:57,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:17:10,053 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 74 treesize of output 66 [2022-12-13 13:17:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093645290] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:17:10,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:17:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2022-12-13 13:17:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718464761] [2022-12-13 13:17:10,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:17:10,068 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:17:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2022-12-13 13:17:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981902775] [2022-12-13 13:17:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:17:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 13:17:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=439, Unknown=1, NotChecked=0, Total=552 [2022-12-13 13:17:10,179 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 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-12-13 13:17:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:17:10,583 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-12-13 13:17:10,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 70 transitions. [2022-12-13 13:17:10,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 13:17:10,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 36 states and 40 transitions. [2022-12-13 13:17:10,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-12-13 13:17:10,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-12-13 13:17:10,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2022-12-13 13:17:10,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:17:10,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-12-13 13:17:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2022-12-13 13:17:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-12-13 13:17:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 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-12-13 13:17:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-12-13 13:17:10,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-13 13:17:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:17:10,590 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-13 13:17:10,590 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 13:17:10,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2022-12-13 13:17:10,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 13:17:10,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:17:10,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:17:10,592 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 13:17:10,592 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2022-12-13 13:17:10,592 INFO L748 eck$LassoCheckResult]: Stem: 811#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 812#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 818#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 826#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 825#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 824#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 823#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 817#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 815#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 816#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 831#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 830#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 829#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 828#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 820#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 821#L557-3 [2022-12-13 13:17:10,592 INFO L750 eck$LassoCheckResult]: Loop: 821#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 837#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 836#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 835#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 834#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 833#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 819#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 813#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 814#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 821#L557-3 [2022-12-13 13:17:10,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash -713568913, now seen corresponding path program 3 times [2022-12-13 13:17:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:10,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557279147] [2022-12-13 13:17:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1628129275, now seen corresponding path program 1 times [2022-12-13 13:17:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:10,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650581324] [2022-12-13 13:17:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:10,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2003257779, now seen corresponding path program 4 times [2022-12-13 13:17:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:10,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003000808] [2022-12-13 13:17:10,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:10,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:17:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:17:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003000808] [2022-12-13 13:17:11,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003000808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40786219] [2022-12-13 13:17:11,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:17:11,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:11,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:11,391 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:17:11,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 13:17:11,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:17:11,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:17:11,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 13:17:11,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:11,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:17:11,602 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:17:11,603 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 32 [2022-12-13 13:17:11,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:17:11,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:17:11,990 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:17:11,990 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 27 treesize of output 29 [2022-12-13 13:17:11,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 13 [2022-12-13 13:17:12,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:17:12,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:17:12,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:17:12,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 13:17:12,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:17:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:17:12,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:17:25,459 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-13 13:17:25,459 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 256 treesize of output 140 [2022-12-13 13:17:25,489 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:17:25,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 219 [2022-12-13 13:17:25,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:17:25,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 148 treesize of output 142 [2022-12-13 13:17:25,520 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:17:25,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 128 [2022-12-13 13:17:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 36 refuted. 10 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:17:25,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40786219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:17:25,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:17:25,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-12-13 13:17:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442750750] [2022-12-13 13:17:25,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:17:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:17:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 13:17:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1144, Unknown=17, NotChecked=0, Total=1406 [2022-12-13 13:17:26,022 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand has 38 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 38 states have internal predecessors, (65), 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-12-13 13:17:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:17:27,415 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-12-13 13:17:27,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2022-12-13 13:17:27,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-12-13 13:17:27,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 60 transitions. [2022-12-13 13:17:27,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2022-12-13 13:17:27,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2022-12-13 13:17:27,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 60 transitions. [2022-12-13 13:17:27,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:17:27,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-12-13 13:17:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 60 transitions. [2022-12-13 13:17:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-12-13 13:17:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-12-13 13:17:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-12-13 13:17:27,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-12-13 13:17:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 13:17:27,420 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-12-13 13:17:27,420 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 13:17:27,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2022-12-13 13:17:27,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-12-13 13:17:27,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:17:27,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:17:27,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 13:17:27,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 13:17:27,422 INFO L748 eck$LassoCheckResult]: Stem: 1102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1109#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1120#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1119#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1118#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1117#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1114#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1115#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1130#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1129#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1127#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1128#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1123#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1124#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1131#L557-3 [2022-12-13 13:17:27,422 INFO L750 eck$LassoCheckResult]: Loop: 1131#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1121#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1116#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1100#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1101#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1131#L557-3 [2022-12-13 13:17:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash -713568913, now seen corresponding path program 5 times [2022-12-13 13:17:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045019779] [2022-12-13 13:17:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash 44950043, now seen corresponding path program 3 times [2022-12-13 13:17:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:27,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119080301] [2022-12-13 13:17:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1933358739, now seen corresponding path program 6 times [2022-12-13 13:17:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:27,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069360146] [2022-12-13 13:17:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:27,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:30,481 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:17:30,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:17:30,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:17:30,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:17:30,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:17:30,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:17:30,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:17:30,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:17:30,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration7_Lasso [2022-12-13 13:17:30,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:17:30,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:17:30,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:30,486 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:30,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,011 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,012 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,016 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,018 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,019 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,022 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,023 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,028 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,030 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:17:31,563 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:17:31,563 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:17:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:17:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:31,565 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:17:31,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-12-13 13:17:31,567 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-12-13 13:17:31,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:17:31,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:17:31,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:17:31,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:17:31,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:17:31,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:17:31,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:17:31,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:17:31,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-12-13 13:17:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:17:31,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:31,584 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:17:31,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-12-13 13:17:31,586 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-12-13 13:17:31,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:17:31,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:17:31,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:17:31,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:17:31,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:17:31,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:17:31,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:17:31,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-12-13 13:17:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:17:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:31,605 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:17:31,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-12-13 13:17:31,607 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-12-13 13:17:31,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:17:31,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:17:31,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:17:31,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:17:31,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:17:31,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:17:31,628 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:17:31,642 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-12-13 13:17:31,642 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-12-13 13:17:31,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:17:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:31,643 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:17:31,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-12-13 13:17:31,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:17:31,655 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:17:31,655 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:17:31,656 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_4 Supporting invariants [] [2022-12-13 13:17:31,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-12-13 13:17:31,719 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-12-13 13:17:31,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-12-13 13:17:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:31,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:17:31,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:31,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:17:31,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:31,900 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 13:17:31,900 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 39 treesize of output 46 [2022-12-13 13:17:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:32,039 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-12-13 13:17:32,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Result 45 states and 52 transitions. Complement of second has 5 states. [2022-12-13 13:17:32,060 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-12-13 13:17:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-12-13 13:17:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 15 letters. Loop has 5 letters. [2022-12-13 13:17:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:17:32,061 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 13:17:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:32,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:17:32,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:32,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:17:32,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:32,236 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 13:17:32,237 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 39 treesize of output 46 [2022-12-13 13:17:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:32,359 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-12-13 13:17:32,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Result 45 states and 52 transitions. Complement of second has 5 states. [2022-12-13 13:17:32,373 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-12-13 13:17:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-12-13 13:17:32,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 15 letters. Loop has 5 letters. [2022-12-13 13:17:32,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:17:32,375 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 13:17:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:17:32,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:32,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:17:32,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:32,547 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 13:17:32,547 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 39 treesize of output 46 [2022-12-13 13:17:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:32,672 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-12-13 13:17:32,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Result 72 states and 84 transitions. Complement of second has 10 states. [2022-12-13 13:17:32,834 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-12-13 13:17:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-12-13 13:17:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-12-13 13:17:32,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 15 letters. Loop has 5 letters. [2022-12-13 13:17:32,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:17:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 20 letters. Loop has 5 letters. [2022-12-13 13:17:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:17:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 15 letters. Loop has 10 letters. [2022-12-13 13:17:32,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:17:32,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 84 transitions. [2022-12-13 13:17:32,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-12-13 13:17:32,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 29 states and 31 transitions. [2022-12-13 13:17:32,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-12-13 13:17:32,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 13:17:32,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2022-12-13 13:17:32,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:17:32,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-12-13 13:17:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2022-12-13 13:17:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-12-13 13:17:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 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-12-13 13:17:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-12-13 13:17:32,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-13 13:17:32,842 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-13 13:17:32,842 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 13:17:32,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2022-12-13 13:17:32,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-12-13 13:17:32,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:17:32,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:17:32,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1] [2022-12-13 13:17:32,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2022-12-13 13:17:32,844 INFO L748 eck$LassoCheckResult]: Stem: 1616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1622#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1633#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1632#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1631#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1630#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1629#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1620#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1621#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1624#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1626#L557-1 [2022-12-13 13:17:32,844 INFO L750 eck$LassoCheckResult]: Loop: 1626#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1625#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1614#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1615#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1618#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1619#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1623#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1635#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1634#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1628#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1627#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1626#L557-1 [2022-12-13 13:17:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2038429094, now seen corresponding path program 3 times [2022-12-13 13:17:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:32,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789558354] [2022-12-13 13:17:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:32,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:32,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash 255892566, now seen corresponding path program 2 times [2022-12-13 13:17:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:32,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348162707] [2022-12-13 13:17:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:32,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:32,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash 368627805, now seen corresponding path program 7 times [2022-12-13 13:17:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:32,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823402869] [2022-12-13 13:17:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:32,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:17:33,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823402869] [2022-12-13 13:17:33,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823402869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:33,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157857675] [2022-12-13 13:17:33,765 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 13:17:33,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:33,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:33,766 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:17:33,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 13:17:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:33,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:17:33,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:33,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:17:34,007 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:17:34,008 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 32 [2022-12-13 13:17:34,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:17:34,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:17:34,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:17:34,503 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:17:34,503 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 32 treesize of output 27 [2022-12-13 13:17:34,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:17:34,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:17:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:34,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:17:48,148 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 93 treesize of output 81 [2022-12-13 13:17:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:48,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157857675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:17:48,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:17:48,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 44 [2022-12-13 13:17:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078464862] [2022-12-13 13:17:48,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:17:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:17:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-13 13:17:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1554, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 13:17:48,739 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand has 44 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 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-12-13 13:17:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:17:49,847 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-12-13 13:17:49,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2022-12-13 13:17:49,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-12-13 13:17:49,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 30 transitions. [2022-12-13 13:17:49,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-12-13 13:17:49,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-12-13 13:17:49,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2022-12-13 13:17:49,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:17:49,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-12-13 13:17:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2022-12-13 13:17:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-13 13:17:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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-12-13 13:17:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-12-13 13:17:49,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-12-13 13:17:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:17:49,852 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-12-13 13:17:49,852 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 13:17:49,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-12-13 13:17:49,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-12-13 13:17:49,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:17:49,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:17:49,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2022-12-13 13:17:49,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2022-12-13 13:17:49,853 INFO L748 eck$LassoCheckResult]: Stem: 1876#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1874#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1875#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1896#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1895#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1894#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1893#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1880#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1881#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1883#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1892#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1891#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1888#L557-1 [2022-12-13 13:17:49,853 INFO L750 eck$LassoCheckResult]: Loop: 1888#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1886#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1887#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1884#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1885#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1882#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1878#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1879#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1899#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1898#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1897#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1890#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1889#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1888#L557-1 [2022-12-13 13:17:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash -425271659, now seen corresponding path program 4 times [2022-12-13 13:17:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:49,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45611411] [2022-12-13 13:17:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:49,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:49,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1099620753, now seen corresponding path program 3 times [2022-12-13 13:17:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:49,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764237111] [2022-12-13 13:17:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:49,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:17:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:17:49,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:17:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:17:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1045081219, now seen corresponding path program 8 times [2022-12-13 13:17:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:17:49,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737935727] [2022-12-13 13:17:49,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:17:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:17:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:17:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:17:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737935727] [2022-12-13 13:17:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737935727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597479393] [2022-12-13 13:17:51,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:17:51,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:17:51,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:17:51,101 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:17:51,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-13 13:17:51,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:17:51,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:17:51,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:17:51,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:17:51,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:17:51,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:17:51,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:17:51,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:17:51,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:17:51,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:17:51,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:17:51,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:17:51,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:17:51,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:17:51,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:17:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 20 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:17:51,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:18:44,144 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 74 treesize of output 66 [2022-12-13 13:18:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 20 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597479393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:18:44,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:18:44,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 45 [2022-12-13 13:18:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279079565] [2022-12-13 13:18:44,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:18:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:18:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 13:18:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1632, Unknown=2, NotChecked=0, Total=1980 [2022-12-13 13:18:45,130 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 45 states, 45 states have (on average 1.6) internal successors, (72), 45 states have internal predecessors, (72), 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-12-13 13:18:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:18:47,270 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-12-13 13:18:47,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 47 transitions. [2022-12-13 13:18:47,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-12-13 13:18:47,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 32 states and 34 transitions. [2022-12-13 13:18:47,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-12-13 13:18:47,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-12-13 13:18:47,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2022-12-13 13:18:47,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:18:47,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-12-13 13:18:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2022-12-13 13:18:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-12-13 13:18:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 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-12-13 13:18:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-12-13 13:18:47,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-12-13 13:18:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 13:18:47,274 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-12-13 13:18:47,274 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 13:18:47,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2022-12-13 13:18:47,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-12-13 13:18:47,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:18:47,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:18:47,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1] [2022-12-13 13:18:47,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2022-12-13 13:18:47,275 INFO L748 eck$LassoCheckResult]: Stem: 2170#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2168#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2169#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2177#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2176#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2172#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2173#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2174#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2175#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2197#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2196#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2195#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2184#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2183#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2180#L557-1 [2022-12-13 13:18:47,275 INFO L750 eck$LassoCheckResult]: Loop: 2180#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2178#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2179#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2194#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2193#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2192#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2191#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2190#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2189#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2188#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2187#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2186#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2185#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2182#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2181#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2180#L557-1 [2022-12-13 13:18:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:18:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash -664170480, now seen corresponding path program 5 times [2022-12-13 13:18:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:18:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067827334] [2022-12-13 13:18:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:18:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:18:47,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:18:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:18:47,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:18:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:18:47,303 INFO L85 PathProgramCache]: Analyzing trace with hash 173589516, now seen corresponding path program 4 times [2022-12-13 13:18:47,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:18:47,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845720211] [2022-12-13 13:18:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:47,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:18:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:18:47,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:18:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:18:47,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:18:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:18:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1999189021, now seen corresponding path program 9 times [2022-12-13 13:18:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:18:47,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363742031] [2022-12-13 13:18:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:18:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 33 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:18:49,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363742031] [2022-12-13 13:18:49,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363742031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:18:49,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530741140] [2022-12-13 13:18:49,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:18:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:18:49,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:18:49,409 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:18:49,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-13 13:18:49,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-13 13:18:49,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:18:49,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:18:49,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:18:49,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:18:49,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:18:49,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:18:49,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:18:49,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:18:49,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:18:49,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:18:50,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:18:50,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:18:50,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:18:50,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:18:50,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:18:50,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:18:50,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:18:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 29 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:18:50,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:20:06,184 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 74 treesize of output 66 [2022-12-13 13:20:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 29 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:06,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530741140] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:20:06,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:20:06,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18, 17] total 52 [2022-12-13 13:20:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276670187] [2022-12-13 13:20:06,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:20:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 13:20:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2022-12-13 13:20:07,999 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:10,272 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-12-13 13:20:10,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 53 transitions. [2022-12-13 13:20:10,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-12-13 13:20:10,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 38 transitions. [2022-12-13 13:20:10,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-12-13 13:20:10,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 13:20:10,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2022-12-13 13:20:10,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:20:10,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-12-13 13:20:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2022-12-13 13:20:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-12-13 13:20:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 33 states have internal predecessors, (36), 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-12-13 13:20:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-12-13 13:20:10,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-12-13 13:20:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 13:20:10,277 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-12-13 13:20:10,277 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 13:20:10,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 36 transitions. [2022-12-13 13:20:10,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-12-13 13:20:10,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:10,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:10,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 1, 1, 1, 1] [2022-12-13 13:20:10,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2022-12-13 13:20:10,278 INFO L748 eck$LassoCheckResult]: Stem: 2511#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2509#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2510#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2537#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2535#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2534#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2532#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2515#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2516#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2519#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2530#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2529#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2528#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2527#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2524#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2523#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2522#L557-1 [2022-12-13 13:20:10,279 INFO L750 eck$LassoCheckResult]: Loop: 2522#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2520#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2521#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2517#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2513#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2514#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2518#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2542#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2541#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2540#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2539#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2538#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2536#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2533#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2531#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2526#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2525#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2522#L557-1 [2022-12-13 13:20:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1682296523, now seen corresponding path program 6 times [2022-12-13 13:20:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:10,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366671244] [2022-12-13 13:20:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:10,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:10,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -684198969, now seen corresponding path program 5 times [2022-12-13 13:20:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:10,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490098230] [2022-12-13 13:20:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:10,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:10,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:10,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1688490557, now seen corresponding path program 10 times [2022-12-13 13:20:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118659011] [2022-12-13 13:20:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 44 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:13,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118659011] [2022-12-13 13:20:13,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118659011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:20:13,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241944573] [2022-12-13 13:20:13,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:20:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:20:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:13,090 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:20:13,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-13 13:20:13,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:20:13,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:20:13,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 13:20:13,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:20:13,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:20:13,552 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:20:13,552 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 32 [2022-12-13 13:20:13,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:20:13,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:20:14,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:20:14,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:20:14,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:20:15,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:20:15,348 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:20:15,349 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 32 treesize of output 27 [2022-12-13 13:20:15,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:15,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:16,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:16,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:16,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 40 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:16,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:20:38,345 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 93 treesize of output 81 [2022-12-13 13:20:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 41 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:38,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241944573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:20:38,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:20:38,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21, 20] total 68 [2022-12-13 13:20:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242770392] [2022-12-13 13:20:38,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:20:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 13:20:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3813, Unknown=1, NotChecked=0, Total=4556 [2022-12-13 13:20:40,705 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. cyclomatic complexity: 4 Second operand has 68 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 68 states have internal predecessors, (98), 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-12-13 13:20:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:44,864 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-12-13 13:20:44,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 59 transitions. [2022-12-13 13:20:44,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-12-13 13:20:44,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 42 transitions. [2022-12-13 13:20:44,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-12-13 13:20:44,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-12-13 13:20:44,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2022-12-13 13:20:44,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:20:44,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-12-13 13:20:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2022-12-13 13:20:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-12-13 13:20:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 37 states have internal predecessors, (40), 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-12-13 13:20:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-12-13 13:20:44,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-12-13 13:20:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:20:44,867 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-12-13 13:20:44,868 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 13:20:44,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 40 transitions. [2022-12-13 13:20:44,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-12-13 13:20:44,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:20:44,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:20:44,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1] [2022-12-13 13:20:44,868 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2022-12-13 13:20:44,869 INFO L748 eck$LassoCheckResult]: Stem: 2915#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2916#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2921#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2941#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2940#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2939#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2937#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2938#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2919#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2920#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2923#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2936#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2935#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2934#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2933#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2932#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2931#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2928#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2927#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2926#L557-1 [2022-12-13 13:20:44,869 INFO L750 eck$LassoCheckResult]: Loop: 2926#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2925#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2913#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2914#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2924#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2922#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2917#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2918#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2950#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2949#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2948#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2947#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2946#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2945#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2944#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2943#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2942#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2930#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2929#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2926#L557-1 [2022-12-13 13:20:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1779256006, now seen corresponding path program 7 times [2022-12-13 13:20:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281694513] [2022-12-13 13:20:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash -385212222, now seen corresponding path program 6 times [2022-12-13 13:20:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183353864] [2022-12-13 13:20:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:44,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 694062557, now seen corresponding path program 11 times [2022-12-13 13:20:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962820547] [2022-12-13 13:20:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 55 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:47,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962820547] [2022-12-13 13:20:47,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962820547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:20:47,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191685245] [2022-12-13 13:20:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:20:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:20:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:47,802 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:20:47,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-13 13:20:47,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-12-13 13:20:47,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:20:47,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 13:20:47,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:20:48,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:20:48,208 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 25 treesize of output 13 [2022-12-13 13:20:48,344 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 25 treesize of output 13 [2022-12-13 13:20:48,471 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 25 treesize of output 13 [2022-12-13 13:20:48,619 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 25 treesize of output 13 [2022-12-13 13:20:48,958 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 13:20:48,959 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 38 treesize of output 29 [2022-12-13 13:20:49,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:49,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:50,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2022-12-13 13:20:50,374 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:20:50,375 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 39 treesize of output 30 [2022-12-13 13:20:50,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:20:50,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:20:51,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:20:51,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:20:51,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:51,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:20:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 27 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:52,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:20:57,093 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 91 treesize of output 79 [2022-12-13 13:20:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 54 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:57,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191685245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:20:57,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:20:57,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 22] total 75 [2022-12-13 13:20:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722183923] [2022-12-13 13:20:57,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:21:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-13 13:21:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=4720, Unknown=0, NotChecked=0, Total=5550 [2022-12-13 13:21:00,354 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. cyclomatic complexity: 4 Second operand has 75 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 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-12-13 13:21:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:21:06,741 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-12-13 13:21:06,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 65 transitions. [2022-12-13 13:21:06,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-12-13 13:21:06,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 44 states and 46 transitions. [2022-12-13 13:21:06,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-12-13 13:21:06,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-12-13 13:21:06,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2022-12-13 13:21:06,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:21:06,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-12-13 13:21:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2022-12-13 13:21:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-12-13 13:21:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 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-12-13 13:21:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-12-13 13:21:06,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-12-13 13:21:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 13:21:06,746 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-12-13 13:21:06,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 13:21:06,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2022-12-13 13:21:06,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-12-13 13:21:06,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:21:06,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:21:06,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1] [2022-12-13 13:21:06,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2022-12-13 13:21:06,748 INFO L748 eck$LassoCheckResult]: Stem: 3364#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3362#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3363#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3372#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3370#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3366#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3367#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3368#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3369#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3371#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3403#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3402#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3401#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3400#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3399#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3398#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3397#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3396#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3379#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3378#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3375#L557-1 [2022-12-13 13:21:06,748 INFO L750 eck$LassoCheckResult]: Loop: 3375#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 3373#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3374#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3395#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3394#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3393#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3392#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3391#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3390#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3389#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3388#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3387#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3386#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3385#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3384#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3383#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3382#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3381#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3380#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3377#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3376#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3375#L557-1 [2022-12-13 13:21:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 468038657, now seen corresponding path program 8 times [2022-12-13 13:21:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:06,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239722520] [2022-12-13 13:21:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:06,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:21:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:06,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:21:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -821757187, now seen corresponding path program 7 times [2022-12-13 13:21:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065538473] [2022-12-13 13:21:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:06,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:06,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:21:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:06,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:21:06,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1955084547, now seen corresponding path program 12 times [2022-12-13 13:21:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:06,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969456001] [2022-12-13 13:21:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 71 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:10,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969456001] [2022-12-13 13:21:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969456001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:21:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982704463] [2022-12-13 13:21:10,453 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:21:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:21:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:21:10,455 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:21:10,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-13 13:21:10,914 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-12-13 13:21:10,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:21:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-13 13:21:10,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:21:10,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:21:10,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:21:11,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:21:11,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:21:11,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:21:11,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:12,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:12,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:12,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:12,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:12,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:13,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:21:13,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:21:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 68 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:13,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:21:56,741 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 74 treesize of output 66 [2022-12-13 13:21:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 68 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982704463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:21:56,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:21:56,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 24, 23] total 72 [2022-12-13 13:21:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656724259] [2022-12-13 13:21:56,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:22:02,885 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 174 DAG size of output: 159 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:22:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:03,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-13 13:22:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=4284, Unknown=2, NotChecked=0, Total=5112 [2022-12-13 13:22:03,048 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 72 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 72 states have internal predecessors, (120), 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-12-13 13:22:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:22:06,855 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-12-13 13:22:06,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 71 transitions. [2022-12-13 13:22:06,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-12-13 13:22:06,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 48 states and 50 transitions. [2022-12-13 13:22:06,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-12-13 13:22:06,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-12-13 13:22:06,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2022-12-13 13:22:06,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:22:06,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-12-13 13:22:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2022-12-13 13:22:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-12-13 13:22:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 45 states have internal predecessors, (48), 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-12-13 13:22:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-12-13 13:22:06,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-12-13 13:22:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 13:22:06,858 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-12-13 13:22:06,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 13:22:06,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 48 transitions. [2022-12-13 13:22:06,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-12-13 13:22:06,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:22:06,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:22:06,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1] [2022-12-13 13:22:06,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2022-12-13 13:22:06,860 INFO L748 eck$LassoCheckResult]: Stem: 3845#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3843#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3844#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3853#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3851#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3847#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3848#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3849#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3850#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3852#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3888#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3887#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3886#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3885#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3884#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3883#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3882#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3881#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3880#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3879#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3860#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3859#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3856#L557-1 [2022-12-13 13:22:06,860 INFO L750 eck$LassoCheckResult]: Loop: 3856#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 3854#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3855#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3878#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3877#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3876#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3875#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3874#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3873#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3872#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3871#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3870#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3869#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3868#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3867#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3866#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3865#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3864#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3863#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3862#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3861#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3858#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3857#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3856#L557-1 [2022-12-13 13:22:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1186416004, now seen corresponding path program 9 times [2022-12-13 13:22:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:06,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742919146] [2022-12-13 13:22:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:06,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:06,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:22:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 565326456, now seen corresponding path program 8 times [2022-12-13 13:22:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:06,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643002913] [2022-12-13 13:22:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:06,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:06,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:22:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1376264803, now seen corresponding path program 13 times [2022-12-13 13:22:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181116519] [2022-12-13 13:22:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 89 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:11,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:11,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181116519] [2022-12-13 13:22:11,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181116519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:22:11,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122728790] [2022-12-13 13:22:11,333 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 13:22:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:22:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:22:11,334 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:22:11,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-13 13:22:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:11,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 13:22:11,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:11,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:22:11,891 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:22:11,892 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 32 [2022-12-13 13:22:12,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:22:12,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:12,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:12,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:13,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:13,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:13,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:13,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:22:14,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:22:14,729 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:22:14,730 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 32 treesize of output 27 [2022-12-13 13:22:14,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:15,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:15,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:15,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:16,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:16,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:16,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:16,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 85 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:17,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:22:36,931 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 93 treesize of output 81 [2022-12-13 13:22:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 86 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:36,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122728790] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:22:36,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:22:36,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 27, 26] total 92 [2022-12-13 13:22:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795923059] [2022-12-13 13:22:36,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:22:45,198 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 189 DAG size of output: 172 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:22:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-12-13 13:22:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=7044, Unknown=0, NotChecked=0, Total=8372 [2022-12-13 13:22:45,376 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. cyclomatic complexity: 4 Second operand has 92 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 92 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:22:51,965 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-12-13 13:22:51,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 77 transitions. [2022-12-13 13:22:51,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-12-13 13:22:51,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 52 states and 54 transitions. [2022-12-13 13:22:51,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-12-13 13:22:51,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-12-13 13:22:51,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 54 transitions. [2022-12-13 13:22:51,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:22:51,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-12-13 13:22:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 54 transitions. [2022-12-13 13:22:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-12-13 13:22:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 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-12-13 13:22:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-12-13 13:22:51,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-12-13 13:22:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 13:22:51,968 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-12-13 13:22:51,968 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 13:22:51,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2022-12-13 13:22:51,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-12-13 13:22:51,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:22:51,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:22:51,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2022-12-13 13:22:51,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2022-12-13 13:22:51,969 INFO L748 eck$LassoCheckResult]: Stem: 4393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 4399#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4425#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 4424#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4423#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4421#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4422#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4397#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4398#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4401#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4420#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4419#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4418#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4417#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4416#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4415#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4414#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4413#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4412#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4411#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4410#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4409#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4406#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4405#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4404#L557-1 [2022-12-13 13:22:51,969 INFO L750 eck$LassoCheckResult]: Loop: 4404#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 4403#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 4391#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4392#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 4402#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4400#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4395#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4396#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4440#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4439#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4438#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4437#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4436#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4435#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4434#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4433#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4432#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4431#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4430#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4429#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4428#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4427#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4426#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4408#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4407#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4404#L557-1 [2022-12-13 13:22:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445705, now seen corresponding path program 10 times [2022-12-13 13:22:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:51,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477153678] [2022-12-13 13:22:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:51,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:51,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:52,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:22:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2112845619, now seen corresponding path program 9 times [2022-12-13 13:22:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:52,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882425419] [2022-12-13 13:22:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:52,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:52,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:22:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -959532611, now seen corresponding path program 14 times [2022-12-13 13:22:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:52,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299387504] [2022-12-13 13:22:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 108 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299387504] [2022-12-13 13:22:57,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299387504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:22:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151958950] [2022-12-13 13:22:57,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:22:57,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:22:57,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:22:57,099 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:22:57,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-13 13:22:57,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:22:57,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:22:57,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 13:22:57,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:57,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:22:57,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:22:57,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:57,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:22:58,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:22:58,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:22:58,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:58,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:59,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:59,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:59,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:59,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:22:59,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:23:00,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:23:00,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:23:00,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:23:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 104 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:23:00,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:24:30,841 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 74 treesize of output 66 [2022-12-13 13:24:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 104 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151958950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:24:30,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:24:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 28, 27] total 87 [2022-12-13 13:24:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143240178] [2022-12-13 13:24:30,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:24:40,330 WARN L233 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 204 DAG size of output: 185 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:24:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:24:40,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-12-13 13:24:40,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=6304, Unknown=0, NotChecked=0, Total=7482 [2022-12-13 13:24:40,506 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 4 Second operand has 87 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 87 states have internal predecessors, (144), 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-12-13 13:24:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:24:46,412 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-12-13 13:24:46,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 83 transitions. [2022-12-13 13:24:46,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 13:24:46,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 56 states and 58 transitions. [2022-12-13 13:24:46,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-12-13 13:24:46,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-12-13 13:24:46,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2022-12-13 13:24:46,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:24:46,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-12-13 13:24:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2022-12-13 13:24:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-12-13 13:24:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 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-12-13 13:24:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-12-13 13:24:46,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-12-13 13:24:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 13:24:46,419 INFO L428 stractBuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-12-13 13:24:46,419 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 13:24:46,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 56 transitions. [2022-12-13 13:24:46,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-12-13 13:24:46,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:24:46,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:24:46,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1] [2022-12-13 13:24:46,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 11, 1, 1, 1, 1] [2022-12-13 13:24:46,421 INFO L748 eck$LassoCheckResult]: Stem: 4969#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 4967#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4968#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 4977#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4975#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4971#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4972#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4973#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4974#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4976#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5020#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5019#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5018#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5017#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5016#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5015#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5014#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5013#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5012#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5011#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5010#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5009#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5008#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5007#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4984#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4983#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4980#L557-1 [2022-12-13 13:24:46,421 INFO L750 eck$LassoCheckResult]: Loop: 4980#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 4978#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 4979#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5006#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 5005#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5004#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5003#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5002#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5001#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5000#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4999#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4998#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4997#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4996#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4995#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4994#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4993#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4992#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4991#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4990#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4989#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4988#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4987#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4986#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4985#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4982#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 4981#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 4980#L557-1 [2022-12-13 13:24:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:24:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 423190322, now seen corresponding path program 11 times [2022-12-13 13:24:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:24:46,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941124648] [2022-12-13 13:24:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:24:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:24:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:24:46,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:24:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:24:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:24:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:24:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1074890450, now seen corresponding path program 10 times [2022-12-13 13:24:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:24:46,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68695734] [2022-12-13 13:24:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:24:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:24:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:24:46,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:24:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:24:46,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:24:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:24:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1423188829, now seen corresponding path program 15 times [2022-12-13 13:24:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:24:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974207712] [2022-12-13 13:24:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:24:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:24:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:24:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 129 proven. 402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:52,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:24:52,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974207712] [2022-12-13 13:24:52,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974207712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:24:52,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827655461] [2022-12-13 13:24:52,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:24:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:24:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:24:52,363 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:24:52,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-13 13:24:53,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-12-13 13:24:53,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:24:53,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-13 13:24:53,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:24:53,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-12-13 13:24:53,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:24:53,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-13 13:24:53,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:24:54,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:24:54,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:54,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:54,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:55,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:55,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:55,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:55,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:55,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:56,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:56,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:24:56,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:24:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 125 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:24:56,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:26:42,287 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 74 treesize of output 66 [2022-12-13 13:26:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 125 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:26:42,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827655461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:26:42,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:26:42,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 30, 29] total 94 [2022-12-13 13:26:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048519454] [2022-12-13 13:26:42,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:26:56,279 WARN L233 SmtUtils]: Spent 13.98s on a formula simplification. DAG size of input: 219 DAG size of output: 198 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:26:56,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:26:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-12-13 13:26:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1369, Invalid=7373, Unknown=0, NotChecked=0, Total=8742 [2022-12-13 13:26:56,478 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. cyclomatic complexity: 4 Second operand has 94 states, 94 states have (on average 1.6595744680851063) internal successors, (156), 94 states have internal predecessors, (156), 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-12-13 13:27:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:03,845 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-12-13 13:27:03,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 89 transitions. [2022-12-13 13:27:03,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-12-13 13:27:03,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 62 transitions. [2022-12-13 13:27:03,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 13:27:03,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 13:27:03,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2022-12-13 13:27:03,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:27:03,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-12-13 13:27:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2022-12-13 13:27:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-12-13 13:27:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 57 states have internal predecessors, (60), 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-12-13 13:27:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-12-13 13:27:03,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-12-13 13:27:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 13:27:03,849 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-12-13 13:27:03,849 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-12-13 13:27:03,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 60 transitions. [2022-12-13 13:27:03,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2022-12-13 13:27:03,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:27:03,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:27:03,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 1, 1, 1, 1] [2022-12-13 13:27:03,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 1, 1, 1, 1] [2022-12-13 13:27:03,850 INFO L748 eck$LassoCheckResult]: Stem: 5592#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 5598#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5628#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 5627#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5626#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5624#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5625#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5596#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5597#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5600#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5623#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5622#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5621#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5620#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5619#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5618#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5617#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5616#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5615#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5614#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5613#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5612#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5611#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5610#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5609#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5608#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5605#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5604#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5603#L557-1 [2022-12-13 13:27:03,850 INFO L750 eck$LassoCheckResult]: Loop: 5603#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 5602#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 5590#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5591#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 5601#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5599#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5594#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5595#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5647#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5646#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5645#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5644#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5643#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5642#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5641#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5640#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5639#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5638#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5637#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5636#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5635#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5634#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5633#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5632#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5631#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5630#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5629#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5607#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 5606#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 5603#L557-1 [2022-12-13 13:27:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1335992979, now seen corresponding path program 12 times [2022-12-13 13:27:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:03,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853206480] [2022-12-13 13:27:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:03,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:03,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2117396585, now seen corresponding path program 11 times [2022-12-13 13:27:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:03,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040468870] [2022-12-13 13:27:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:03,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:27:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:27:03,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:27:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash -708308355, now seen corresponding path program 16 times [2022-12-13 13:27:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:03,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393734195] [2022-12-13 13:27:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:03,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 152 proven. 475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393734195] [2022-12-13 13:27:11,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393734195] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499845472] [2022-12-13 13:27:11,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:27:11,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:12,000 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:12,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-13 13:27:12,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:27:12,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:27:12,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-13 13:27:12,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:12,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:27:12,899 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:27:12,900 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 32 [2022-12-13 13:27:13,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:27:13,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:13,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:14,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:14,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:14,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:15,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:15,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:16,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:16,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:16,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:27:17,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:27:18,126 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:27:18,127 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 32 treesize of output 27 [2022-12-13 13:27:18,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:18,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:19,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:19,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:19,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:20,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:20,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:20,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:21,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:21,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:22,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:27:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 148 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:22,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:32,350 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 93 treesize of output 81 [2022-12-13 13:27:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 149 proven. 478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:32,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499845472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:27:32,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:27:32,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 33, 32] total 116 [2022-12-13 13:27:32,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237436409] [2022-12-13 13:27:32,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:49,957 WARN L233 SmtUtils]: Spent 17.59s on a formula simplification. DAG size of input: 234 DAG size of output: 211 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:27:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-12-13 13:27:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=11247, Unknown=0, NotChecked=0, Total=13340 [2022-12-13 13:27:50,159 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. cyclomatic complexity: 4 Second operand has 116 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 116 states have internal predecessors, (170), 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-12-13 13:28:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:28:02,408 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2022-12-13 13:28:02,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 95 transitions. [2022-12-13 13:28:02,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-12-13 13:28:02,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 64 states and 66 transitions. [2022-12-13 13:28:02,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-12-13 13:28:02,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-12-13 13:28:02,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2022-12-13 13:28:02,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:28:02,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 66 transitions. [2022-12-13 13:28:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2022-12-13 13:28:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-12-13 13:28:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.032258064516129) internal successors, (64), 61 states have internal predecessors, (64), 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-12-13 13:28:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-12-13 13:28:02,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-12-13 13:28:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-13 13:28:02,412 INFO L428 stractBuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-12-13 13:28:02,412 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-12-13 13:28:02,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 64 transitions. [2022-12-13 13:28:02,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-12-13 13:28:02,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:28:02,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:28:02,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 1, 1, 1, 1] [2022-12-13 13:28:02,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 1, 1, 1, 1] [2022-12-13 13:28:02,413 INFO L748 eck$LassoCheckResult]: Stem: 6284#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#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~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_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_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 6282#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6283#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 6292#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6290#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6286#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6287#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6288#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6289#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6291#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6343#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6342#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6341#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6340#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6339#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6338#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6337#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6336#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6335#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6334#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6333#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6332#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6331#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6330#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6329#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6328#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6327#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6326#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6299#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6298#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6295#L557-1 [2022-12-13 13:28:02,413 INFO L750 eck$LassoCheckResult]: Loop: 6295#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 6293#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 6294#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6325#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 6324#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6323#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6322#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6321#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6320#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6319#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6318#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6317#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6316#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6315#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6314#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6313#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6312#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6311#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6310#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6309#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6308#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6307#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6306#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6305#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6304#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6303#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6302#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6301#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6300#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6297#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 6296#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 6295#L557-1 [2022-12-13 13:28:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 305969384, now seen corresponding path program 13 times [2022-12-13 13:28:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:02,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048895582] [2022-12-13 13:28:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:28:02,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:28:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:28:02,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:28:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -996379420, now seen corresponding path program 12 times [2022-12-13 13:28:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256547798] [2022-12-13 13:28:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:28:02,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:28:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:28:02,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:28:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -61710563, now seen corresponding path program 17 times [2022-12-13 13:28:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:02,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787973443] [2022-12-13 13:28:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 177 proven. 554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:28:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:28:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787973443] [2022-12-13 13:28:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787973443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:28:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101654539] [2022-12-13 13:28:11,671 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:28:11,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:28:11,673 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:28:11,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a547b6-d178-4b52-b72c-06c0e34a8201/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-13 13:28:12,306 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-12-13 13:28:12,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:28:12,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-13 13:28:12,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:28:12,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:28:12,724 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-12-13 13:28:12,963 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-12-13 13:28:13,199 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-12-13 13:28:13,421 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-12-13 13:28:13,668 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-12-13 13:28:13,930 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-12-13 13:28:14,184 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-12-13 13:28:14,753 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:28:14,754 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 32 [2022-12-13 13:28:15,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 13:28:15,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:28:16,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:28:16,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:28:16,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 13:28:18,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 13:28:18,560 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 13:28:18,560 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 32 treesize of output 27 [2022-12-13 13:28:18,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:19,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:19,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:20,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:20,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:20,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:21,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:21,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:22,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:22,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:23,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:23,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 13:28:23,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 13:28:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 173 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:28:24,223 INFO L328 TraceCheckSpWp]: Computing backward predicates...