./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 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_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- 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-4e7fbc6 [2022-11-23 03:51:34,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:51:34,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:51:34,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:51:34,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:51:34,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:51:34,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:51:34,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:51:34,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:51:34,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:51:34,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:51:34,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:51:34,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:51:34,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:51:34,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:51:34,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:51:34,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:51:34,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:51:34,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:51:34,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:51:34,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:51:34,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:51:34,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:51:34,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:51:34,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:51:34,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:51:34,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:51:34,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:51:34,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:51:34,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:51:34,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:51:34,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:51:34,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:51:34,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:51:34,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:51:34,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:51:34,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:51:34,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:51:34,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:51:34,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:51:34,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:51:34,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 03:51:34,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:51:34,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:51:34,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:51:34,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:51:34,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:51:34,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:51:34,444 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:51:34,444 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 03:51:34,444 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 03:51:34,444 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 03:51:34,445 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 03:51:34,446 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 03:51:34,446 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 03:51:34,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:51:34,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:51:34,446 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:51:34,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:51:34,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:51:34,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:51:34,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 03:51:34,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 03:51:34,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 03:51:34,448 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:51:34,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:51:34,448 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 03:51:34,448 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:51:34,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 03:51:34,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:51:34,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:51:34,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:51:34,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:51:34,451 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 03:51:34,451 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_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/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_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2022-11-23 03:51:34,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:51:34,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:51:34,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:51:34,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:51:34,815 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:51:34,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-23 03:51:37,876 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:51:38,103 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:51:38,104 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-11-23 03:51:38,111 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/data/a6c8a2e22/597e744cc8794692ad447be41b1b9892/FLAGa010937e3 [2022-11-23 03:51:38,127 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/data/a6c8a2e22/597e744cc8794692ad447be41b1b9892 [2022-11-23 03:51:38,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:51:38,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:51:38,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:51:38,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:51:38,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:51:38,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e43ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38, skipping insertion in model container [2022-11-23 03:51:38,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:51:38,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:51:38,296 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-23 03:51:38,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:51:38,365 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:51:38,379 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-11-23 03:51:38,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:51:38,432 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:51:38,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38 WrapperNode [2022-11-23 03:51:38,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:51:38,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:51:38,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:51:38,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:51:38,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,474 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2022-11-23 03:51:38,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:51:38,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:51:38,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:51:38,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:51:38,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,528 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:51:38,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:51:38,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:51:38,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:51:38,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (1/1) ... [2022-11-23 03:51:38,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:38,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:38,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:38,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 03:51:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:51:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 03:51:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:51:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:51:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:51:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:51:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:51:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:51:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:51:38,722 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:51:38,724 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:51:39,155 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:51:39,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:51:39,173 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-23 03:51:39,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:39 BoogieIcfgContainer [2022-11-23 03:51:39,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:51:39,177 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 03:51:39,177 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 03:51:39,181 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 03:51:39,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:51:39,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:51:38" (1/3) ... [2022-11-23 03:51:39,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6998b131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:39, skipping insertion in model container [2022-11-23 03:51:39,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:51:39,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:38" (2/3) ... [2022-11-23 03:51:39,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6998b131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:39, skipping insertion in model container [2022-11-23 03:51:39,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 03:51:39,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:39" (3/3) ... [2022-11-23 03:51:39,185 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2022-11-23 03:51:39,244 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 03:51:39,245 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 03:51:39,245 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 03:51:39,245 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 03:51:39,245 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 03:51:39,245 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 03:51:39,245 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 03:51:39,246 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 03:51:39,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-11-23 03:51:39,266 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2022-11-23 03:51:39,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:39,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:39,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 03:51:39,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 03:51:39,273 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 03:51:39,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-11-23 03:51:39,277 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2022-11-23 03:51:39,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:39,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:39,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-23 03:51:39,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-23 03:51:39,284 INFO L748 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 35#L19-3true [2022-11-23 03:51:39,285 INFO L750 eck$LassoCheckResult]: Loop: 35#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 35#L19-3true [2022-11-23 03:51:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-23 03:51:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:39,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898469971] [2022-11-23 03:51:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-23 03:51:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:39,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671612357] [2022-11-23 03:51:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-11-23 03:51:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:39,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771934121] [2022-11-23 03:51:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:39,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:40,425 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 03:51:40,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 03:51:40,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 03:51:40,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 03:51:40,427 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-23 03:51:40,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:40,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 03:51:40,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 03:51:40,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2022-11-23 03:51:40,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 03:51:40,442 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 03:51:40,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:40,479 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:40,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:40,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,161 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,171 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,194 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,199 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:51:41,722 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-23 03:51:41,727 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-23 03:51:41,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:41,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:41,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:41,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-23 03:51:41,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:41,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:41,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:51:41,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:41,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:41,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:41,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:51:41,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:51:41,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:41,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-23 03:51:41,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:41,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:41,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:41,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:41,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-23 03:51:41,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:41,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:51:41,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:41,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:41,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:41,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:51:41,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:51:41,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:41,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:41,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:41,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:41,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:41,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-23 03:51:41,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:41,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:41,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:41,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:41,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:41,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:41,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:41,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:41,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:41,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:41,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:41,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-23 03:51:41,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:41,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:41,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:41,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:41,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:41,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:41,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:41,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:41,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:41,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:41,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:41,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-23 03:51:41,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:41,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:41,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:41,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:41,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:41,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:41,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-23 03:51:42,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-23 03:51:42,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-23 03:51:42,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-23 03:51:42,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,239 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-23 03:51:42,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,290 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-23 03:51:42,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-23 03:51:42,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,399 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-23 03:51:42,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:51:42,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:51:42,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-23 03:51:42,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:51:42,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:51:42,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:51:42,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:51:42,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:51:42,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:51:42,517 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-23 03:51:42,607 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-11-23 03:51:42,607 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-11-23 03:51:42,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:51:42,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:42,661 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:51:42,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-23 03:51:42,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-23 03:51:42,744 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-23 03:51:42,744 INFO L513 LassoAnalysis]: Proved termination. [2022-11-23 03:51:42,745 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2022-11-23 03:51:42,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:42,845 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2022-11-23 03:51:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:42,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:51:42,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:42,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:51:42,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:43,002 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-23 03:51:43,004 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-11-23 03:51:43,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 95 states and 138 transitions. Complement of second has 7 states. [2022-11-23 03:51:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-23 03:51:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-11-23 03:51:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-11-23 03:51:43,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2022-11-23 03:51:43,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:51:43,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-23 03:51:43,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:51:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2022-11-23 03:51:43,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:51:43,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2022-11-23 03:51:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2022-11-23 03:51:43,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-11-23 03:51:43,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-11-23 03:51:43,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-23 03:51:43,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:43,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-23 03:51:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-23 03:51:43,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-23 03:51:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-11-23 03:51:43,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-23 03:51:43,125 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-23 03:51:43,126 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 03:51:43,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2022-11-23 03:51:43,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:43,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:43,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:43,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:51:43,128 INFO L748 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 260#L19-3 assume !(init_~i~0#1 < 2); 277#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 268#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 264#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 257#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 258#L27-3 [2022-11-23 03:51:43,129 INFO L750 eck$LassoCheckResult]: Loop: 258#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 279#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 263#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 258#L27-3 [2022-11-23 03:51:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2022-11-23 03:51:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303713443] [2022-11-23 03:51:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303713443] [2022-11-23 03:51:43,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303713443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:51:43,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:51:43,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:51:43,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807283466] [2022-11-23 03:51:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:51:43,209 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:51:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2022-11-23 03:51:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944685381] [2022-11-23 03:51:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:51:43,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:51:43,317 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:51:43,345 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-23 03:51:43,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-11-23 03:51:43,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-11-23 03:51:43,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-11-23 03:51:43,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-11-23 03:51:43,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-11-23 03:51:43,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:43,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-23 03:51:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-11-23 03:51:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-11-23 03:51:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 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-11-23 03:51:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-23 03:51:43,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-23 03:51:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:51:43,358 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-23 03:51:43,358 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 03:51:43,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2022-11-23 03:51:43,360 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:43,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:43,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:43,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:51:43,363 INFO L748 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 323#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 315#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 316#L19-3 assume !(init_~i~0#1 < 2); 340#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 328#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 327#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 317#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 318#L27-3 [2022-11-23 03:51:43,363 INFO L750 eck$LassoCheckResult]: Loop: 318#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 342#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 326#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 318#L27-3 [2022-11-23 03:51:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2022-11-23 03:51:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027230034] [2022-11-23 03:51:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:43,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027230034] [2022-11-23 03:51:43,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027230034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:51:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635617235] [2022-11-23 03:51:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:51:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:43,510 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:51:43,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 03:51:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:43,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:51:43,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:43,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:51:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:43,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635617235] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:51:43,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:51:43,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-23 03:51:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370903874] [2022-11-23 03:51:43,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:51:43,636 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:51:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2022-11-23 03:51:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861157192] [2022-11-23 03:51:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:51:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:51:43,728 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-11-23 03:51:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:51:43,759 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-11-23 03:51:43,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2022-11-23 03:51:43,761 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2022-11-23 03:51:43,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-11-23 03:51:43,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-11-23 03:51:43,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2022-11-23 03:51:43,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:43,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-11-23 03:51:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2022-11-23 03:51:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-23 03:51:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-11-23 03:51:43,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-11-23 03:51:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:51:43,768 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-11-23 03:51:43,768 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 03:51:43,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2022-11-23 03:51:43,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-11-23 03:51:43,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:43,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:43,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:43,770 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:51:43,770 INFO L748 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 437#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 429#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 430#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 457#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 458#L19-3 assume !(init_~i~0#1 < 2); 454#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 442#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 441#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 431#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 432#L27-3 [2022-11-23 03:51:43,770 INFO L750 eck$LassoCheckResult]: Loop: 432#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 456#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 440#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 432#L27-3 [2022-11-23 03:51:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2022-11-23 03:51:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981433417] [2022-11-23 03:51:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2022-11-23 03:51:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019586530] [2022-11-23 03:51:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:43,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2022-11-23 03:51:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824188440] [2022-11-23 03:51:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:44,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-23 03:51:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:51:44,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824188440] [2022-11-23 03:51:44,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824188440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:51:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324798843] [2022-11-23 03:51:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:51:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:51:44,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:51:44,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 03:51:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:51:44,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 03:51:44,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:51:45,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-23 03:51:45,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,009 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 18 treesize of output 20 [2022-11-23 03:51:45,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-23 03:51:45,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,028 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 18 treesize of output 20 [2022-11-23 03:51:45,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,134 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 03:51:45,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,146 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 03:51:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,155 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-11-23 03:51:45,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:51:45,163 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-11-23 03:51:45,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:51:45,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:51:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:51:45,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:51:45,379 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_init_~i~0#1|)))) (and (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)))) is different from false [2022-11-23 03:51:45,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:51:45,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-11-23 03:51:45,609 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 78 treesize of output 74 [2022-11-23 03:51:45,618 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 41 treesize of output 39 [2022-11-23 03:51:45,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:51:45,633 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 53 treesize of output 55 [2022-11-23 03:51:45,641 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 80 treesize of output 76 [2022-11-23 03:51:45,702 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:51:45,702 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2022-11-23 03:51:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 03:51:45,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324798843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:51:45,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:51:45,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-23 03:51:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870757023] [2022-11-23 03:51:45,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:51:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:51:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 03:51:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=325, Unknown=2, NotChecked=38, Total=462 [2022-11-23 03:51:45,791 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:51:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:51:46,114 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-11-23 03:51:46,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2022-11-23 03:51:46,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-11-23 03:51:46,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2022-11-23 03:51:46,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-11-23 03:51:46,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-23 03:51:46,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2022-11-23 03:51:46,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:51:46,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-23 03:51:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2022-11-23 03:51:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 03:51:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 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-11-23 03:51:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-23 03:51:46,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-23 03:51:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:51:46,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-23 03:51:46,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-23 03:51:46,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2022-11-23 03:51:46,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-11-23 03:51:46,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:51:46,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:51:46,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:51:46,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:51:46,126 INFO L748 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 610#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 600#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 601#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 627#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 628#L19-3 assume !(init_~i~0#1 < 2); 624#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 615#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 611#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 602#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 603#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 626#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 622#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 621#L27-7 [2022-11-23 03:51:46,127 INFO L750 eck$LassoCheckResult]: Loop: 621#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 612#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 614#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 621#L27-7 [2022-11-23 03:51:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2022-11-23 03:51:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:46,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177372046] [2022-11-23 03:51:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2022-11-23 03:51:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:46,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710518984] [2022-11-23 03:51:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:51:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:51:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2022-11-23 03:51:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:51:46,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134387440] [2022-11-23 03:51:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:51:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:51:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:51:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:51:46,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:12,576 WARN L233 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 286 DAG size of output: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 03:52:15,157 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 03:52:15,157 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 03:52:15,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 03:52:15,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 03:52:15,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-23 03:52:15,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:15,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 03:52:15,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 03:52:15,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2022-11-23 03:52:15,158 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 03:52:15,158 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 03:52:15,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,169 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,172 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,175 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,185 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,188 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:15,194 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,963 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,967 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,971 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,985 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:16,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 03:52:17,780 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-23 03:52:17,780 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-23 03:52:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:17,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:17,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:17,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-23 03:52:17,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:17,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:17,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:17,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:17,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:52:17,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:52:17,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:17,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:17,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:17,873 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:17,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:17,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-23 03:52:17,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:17,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:52:17,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:17,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:17,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:17,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:52:17,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:52:17,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:17,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:17,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:17,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:17,910 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:17,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:17,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-23 03:52:17,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:17,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:52:17,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:17,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:17,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:17,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:52:17,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:52:17,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:17,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:17,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:17,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:17,952 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:17,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:17,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:17,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:17,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:17,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:17,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-23 03:52:17,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:52:17,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:52:17,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:18,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,009 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:18,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:18,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:52:18,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:18,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:18,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:18,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:52:18,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:52:18,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-23 03:52:18,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:18,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,055 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:18,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:18,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:18,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:18,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:18,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:52:18,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:52:18,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-23 03:52:18,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:18,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,095 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-23 03:52:18,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:18,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:18,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-23 03:52:18,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:18,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:18,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:18,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-23 03:52:18,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-23 03:52:18,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:18,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,126 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-23 03:52:18,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:18,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:18,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:18,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:18,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:18,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:52:18,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:52:18,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-23 03:52:18,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,181 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-23 03:52:18,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-23 03:52:18,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-23 03:52:18,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-23 03:52:18,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-23 03:52:18,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-23 03:52:18,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-23 03:52:18,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-23 03:52:18,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-23 03:52:18,269 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-11-23 03:52:18,269 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-11-23 03:52:18,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 03:52:18,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:18,272 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 03:52:18,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-23 03:52:18,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-23 03:52:18,285 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-23 03:52:18,285 INFO L513 LassoAnalysis]: Proved termination. [2022-11-23 03:52:18,285 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2022-11-23 03:52:18,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,517 INFO L156 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2022-11-23 03:52:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:18,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:52:18,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:18,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:52:18,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:52:18,657 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-23 03:52:18,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11-23 03:52:18,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Result 68 states and 88 transitions. Complement of second has 6 states. [2022-11-23 03:52:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-23 03:52:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-11-23 03:52:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-11-23 03:52:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2022-11-23 03:52:18,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:52:18,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2022-11-23 03:52:18,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:52:18,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2022-11-23 03:52:18,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-23 03:52:18,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-11-23 03:52:18,703 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-11-23 03:52:18,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2022-11-23 03:52:18,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-23 03:52:18,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-23 03:52:18,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2022-11-23 03:52:18,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:18,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-11-23 03:52:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2022-11-23 03:52:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-11-23 03:52:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-23 03:52:18,714 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-23 03:52:18,714 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-23 03:52:18,714 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-23 03:52:18,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-11-23 03:52:18,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:18,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:18,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:18,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:18,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:52:18,717 INFO L748 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 934#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 926#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 927#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 955#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 956#L19-3 assume !(init_~i~0#1 < 2); 952#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 938#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 937#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 928#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 929#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 954#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 949#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 950#L27-7 assume !(f_~i~1#1 < 2); 940#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 930#L38-3 [2022-11-23 03:52:18,723 INFO L750 eck$LassoCheckResult]: Loop: 930#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 932#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 945#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 930#L38-3 [2022-11-23 03:52:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2022-11-23 03:52:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:18,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631307598] [2022-11-23 03:52:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:18,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:18,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:18,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631307598] [2022-11-23 03:52:18,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631307598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:52:18,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:52:18,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:52:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194549916] [2022-11-23 03:52:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:52:18,814 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:52:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 1 times [2022-11-23 03:52:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:18,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600678286] [2022-11-23 03:52:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:18,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:18,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:52:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:52:18,889 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:18,917 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-23 03:52:18,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-11-23 03:52:18,919 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-11-23 03:52:18,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-11-23 03:52:18,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-23 03:52:18,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-23 03:52:18,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-11-23 03:52:18,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:18,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-23 03:52:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-11-23 03:52:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-11-23 03:52:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-11-23 03:52:18,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-11-23 03:52:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:52:18,933 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-11-23 03:52:18,934 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-23 03:52:18,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-11-23 03:52:18,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:18,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:18,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:18,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:18,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:52:18,936 INFO L748 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1017#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1009#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1010#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1038#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1039#L19-3 assume !(init_~i~0#1 < 2); 1035#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1021#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1020#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1011#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1012#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1037#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1032#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1033#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1022#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1023#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1013#L38-3 [2022-11-23 03:52:18,936 INFO L750 eck$LassoCheckResult]: Loop: 1013#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1015#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1028#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1013#L38-3 [2022-11-23 03:52:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2022-11-23 03:52:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:18,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36491126] [2022-11-23 03:52:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36491126] [2022-11-23 03:52:19,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36491126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:52:19,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:52:19,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:52:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200618567] [2022-11-23 03:52:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:52:19,677 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:52:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 2 times [2022-11-23 03:52:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3117575] [2022-11-23 03:52:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:19,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:19,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:52:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:52:19,750 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-11-23 03:52:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:20,030 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-23 03:52:20,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2022-11-23 03:52:20,031 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-11-23 03:52:20,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2022-11-23 03:52:20,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-11-23 03:52:20,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-23 03:52:20,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-11-23 03:52:20,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:20,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-11-23 03:52:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-11-23 03:52:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-11-23 03:52:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-23 03:52:20,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-23 03:52:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:52:20,036 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-23 03:52:20,036 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-23 03:52:20,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2022-11-23 03:52:20,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:20,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:20,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:20,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:20,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:52:20,038 INFO L748 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1116#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1106#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1107#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1135#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1136#L19-3 assume !(init_~i~0#1 < 2); 1132#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1118#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1117#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1108#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1109#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1134#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1129#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1130#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1121#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1122#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1128#L27-7 assume !(f_~i~1#1 < 2); 1120#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1110#L38-3 [2022-11-23 03:52:20,038 INFO L750 eck$LassoCheckResult]: Loop: 1110#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1112#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1125#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1110#L38-3 [2022-11-23 03:52:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2022-11-23 03:52:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:20,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378015961] [2022-11-23 03:52:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378015961] [2022-11-23 03:52:20,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378015961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:20,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418524353] [2022-11-23 03:52:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:52:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:20,105 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:52:20,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 03:52:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:20,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:52:20,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:20,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:52:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:20,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418524353] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:52:20,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:52:20,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-23 03:52:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947908548] [2022-11-23 03:52:20,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:52:20,292 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:52:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 3 times [2022-11-23 03:52:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298895159] [2022-11-23 03:52:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:52:20,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:52:20,373 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:20,404 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-23 03:52:20,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-11-23 03:52:20,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-11-23 03:52:20,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-11-23 03:52:20,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-11-23 03:52:20,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-11-23 03:52:20,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-11-23 03:52:20,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:20,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-23 03:52:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-11-23 03:52:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-11-23 03:52:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-23 03:52:20,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-23 03:52:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:52:20,414 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-23 03:52:20,416 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-23 03:52:20,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2022-11-23 03:52:20,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:20,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:20,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:20,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:20,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:52:20,420 INFO L748 eck$LassoCheckResult]: Stem: 1320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1309#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1299#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1300#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1329#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1330#L19-3 assume !(init_~i~0#1 < 2); 1325#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1311#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1310#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1304#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1305#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1327#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1322#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1323#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1314#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1315#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1321#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1312#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1313#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1301#L38-3 [2022-11-23 03:52:20,421 INFO L750 eck$LassoCheckResult]: Loop: 1301#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1303#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1318#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1301#L38-3 [2022-11-23 03:52:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2022-11-23 03:52:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179619723] [2022-11-23 03:52:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 4 times [2022-11-23 03:52:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028904760] [2022-11-23 03:52:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:20,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash 951949698, now seen corresponding path program 1 times [2022-11-23 03:52:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:20,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824933021] [2022-11-23 03:52:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824933021] [2022-11-23 03:52:22,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824933021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871013308] [2022-11-23 03:52:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:52:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:22,116 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:52:22,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 03:52:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:22,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-23 03:52:22,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:22,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-23 03:52:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,596 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-11-23 03:52:22,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-23 03:52:22,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,617 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-11-23 03:52:22,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,944 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 03:52:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 03:52:22,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,962 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-11-23 03:52:22,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:22,969 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-11-23 03:52:23,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:52:23,089 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 22 treesize of output 10 [2022-11-23 03:52:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:23,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:52:23,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_f_~i~1#1|)))) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) is different from false [2022-11-23 03:52:23,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:23,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-11-23 03:52:23,694 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 78 treesize of output 74 [2022-11-23 03:52:23,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:52:23,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:23,706 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 36 treesize of output 38 [2022-11-23 03:52:23,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:52:23,715 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 24 treesize of output 22 [2022-11-23 03:52:23,721 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 46 treesize of output 42 [2022-11-23 03:52:23,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:23,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-11-23 03:52:23,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:52:23,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 23 [2022-11-23 03:52:23,783 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 03:52:23,784 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 32 treesize of output 28 [2022-11-23 03:52:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-23 03:52:23,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871013308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:52:23,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:52:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 33 [2022-11-23 03:52:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166479041] [2022-11-23 03:52:23,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:52:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 03:52:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=895, Unknown=1, NotChecked=62, Total=1122 [2022-11-23 03:52:23,943 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:25,281 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-23 03:52:25,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2022-11-23 03:52:25,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:25,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2022-11-23 03:52:25,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-23 03:52:25,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-11-23 03:52:25,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2022-11-23 03:52:25,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:25,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-11-23 03:52:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2022-11-23 03:52:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-11-23 03:52:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-23 03:52:25,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-23 03:52:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 03:52:25,289 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-23 03:52:25,290 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-23 03:52:25,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2022-11-23 03:52:25,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-23 03:52:25,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:25,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:25,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:25,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-23 03:52:25,293 INFO L748 eck$LassoCheckResult]: Stem: 1584#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1573#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1564#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1565#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1595#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1599#L19-3 assume !(init_~i~0#1 < 2); 1591#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1579#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1574#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1568#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1569#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1593#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1586#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1587#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1577#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1578#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1585#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1575#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1576#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1566#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1567#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1583#L41 [2022-11-23 03:52:25,293 INFO L750 eck$LassoCheckResult]: Loop: 1583#L41 assume 1 == g_#t~mem9#1; 1581#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1582#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1590#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1597#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1583#L41 [2022-11-23 03:52:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2022-11-23 03:52:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:25,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944498035] [2022-11-23 03:52:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:25,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:25,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 1 times [2022-11-23 03:52:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192150149] [2022-11-23 03:52:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:25,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:25,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -289347350, now seen corresponding path program 1 times [2022-11-23 03:52:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678619924] [2022-11-23 03:52:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:26,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678619924] [2022-11-23 03:52:26,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678619924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:26,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869139073] [2022-11-23 03:52:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:26,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:52:26,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:26,085 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:52:26,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 03:52:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:26,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 03:52:26,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:26,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-23 03:52:26,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:26,700 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 16 treesize of output 18 [2022-11-23 03:52:26,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:26,876 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 16 treesize of output 18 [2022-11-23 03:52:26,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:52:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:27,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:52:27,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:27,229 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-23 03:52:27,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:27,236 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 41 treesize of output 37 [2022-11-23 03:52:27,242 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 22 treesize of output 18 [2022-11-23 03:52:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:52:27,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869139073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:52:27,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:52:27,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-23 03:52:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764056189] [2022-11-23 03:52:27,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:52:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 03:52:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=815, Unknown=9, NotChecked=0, Total=930 [2022-11-23 03:52:27,747 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:29,530 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-11-23 03:52:29,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2022-11-23 03:52:29,531 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2022-11-23 03:52:29,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 86 transitions. [2022-11-23 03:52:29,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-23 03:52:29,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-11-23 03:52:29,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 86 transitions. [2022-11-23 03:52:29,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-23 03:52:29,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-11-23 03:52:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 86 transitions. [2022-11-23 03:52:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-11-23 03:52:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 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-11-23 03:52:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-11-23 03:52:29,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-23 03:52:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 03:52:29,542 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-11-23 03:52:29,542 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-23 03:52:29,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2022-11-23 03:52:29,542 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-11-23 03:52:29,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:29,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:29,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:29,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-23 03:52:29,544 INFO L748 eck$LassoCheckResult]: Stem: 1924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1911#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1904#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1905#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1939#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1940#L19-3 assume !(init_~i~0#1 < 2); 1931#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1915#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1914#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1906#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1907#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1935#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1926#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1927#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1936#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1942#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1937#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1918#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1919#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1925#L27-7 assume !(f_~i~1#1 < 2); 1941#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1954#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1943#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1932#L41 [2022-11-23 03:52:29,544 INFO L750 eck$LassoCheckResult]: Loop: 1932#L41 assume 1 == g_#t~mem9#1; 1933#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1947#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1944#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1945#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1932#L41 [2022-11-23 03:52:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2022-11-23 03:52:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:29,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877599124] [2022-11-23 03:52:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:52:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:30,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877599124] [2022-11-23 03:52:30,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877599124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:30,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024169165] [2022-11-23 03:52:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:52:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:30,465 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:52:30,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-23 03:52:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:30,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 03:52:30,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:30,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-23 03:52:30,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:30,749 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 16 treesize of output 18 [2022-11-23 03:52:30,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-23 03:52:30,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:30,761 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 16 treesize of output 18 [2022-11-23 03:52:30,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:30,973 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 03:52:30,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:30,983 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-23 03:52:30,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:30,993 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 16 treesize of output 18 [2022-11-23 03:52:31,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:52:31,007 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 16 treesize of output 18 [2022-11-23 03:52:31,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:52:31,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:52:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:52:31,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:52:31,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_f_~i~1#1|))) (.cse1 (+ |c_~#pp~0.offset| 4))) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) .cse1) 0)) (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) .cse1) 0)))) is different from false [2022-11-23 03:52:31,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:52:31,440 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-23 03:52:31,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:52:31,449 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-23 03:52:31,450 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 1 case distinctions, treesize of input 22 treesize of output 13 [2022-11-23 03:52:31,457 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:52:31,457 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-11-23 03:52:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:52:31,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024169165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:52:31,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:52:31,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-11-23 03:52:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658263661] [2022-11-23 03:52:31,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:52:31,496 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 03:52:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 2 times [2022-11-23 03:52:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:31,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559623700] [2022-11-23 03:52:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:31,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:31,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 03:52:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=595, Unknown=1, NotChecked=50, Total=756 [2022-11-23 03:52:31,767 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:32,980 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-23 03:52:32,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2022-11-23 03:52:32,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-11-23 03:52:32,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2022-11-23 03:52:32,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-23 03:52:32,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-11-23 03:52:32,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2022-11-23 03:52:32,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:52:32,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-23 03:52:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2022-11-23 03:52:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-23 03:52:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-23 03:52:32,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-23 03:52:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:52:32,989 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-23 03:52:32,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-23 03:52:32,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2022-11-23 03:52:32,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-11-23 03:52:32,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 03:52:32,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 03:52:32,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:52:32,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-23 03:52:32,991 INFO L748 eck$LassoCheckResult]: Stem: 2203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 2193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 2194#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2185#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2186#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2214#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2218#L19-3 assume !(init_~i~0#1 < 2); 2211#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 2196#L49 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 2195#L49-1 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 2189#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2190#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2213#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2205#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2206#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2197#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 2198#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 2204#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2219#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2207#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 2187#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2188#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2202#L41 assume 1 == g_#t~mem9#1; 2200#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2201#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2210#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2216#L39 [2022-11-23 03:52:32,991 INFO L750 eck$LassoCheckResult]: Loop: 2216#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 2217#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2215#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2216#L39 [2022-11-23 03:52:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash -147881120, now seen corresponding path program 2 times [2022-11-23 03:52:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:32,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804376971] [2022-11-23 03:52:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:33,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:33,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash 116228, now seen corresponding path program 5 times [2022-11-23 03:52:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611643569] [2022-11-23 03:52:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:33,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:52:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:52:33,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:52:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:52:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1110086213, now seen corresponding path program 1 times [2022-11-23 03:52:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:52:33,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269957678] [2022-11-23 03:52:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:52:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 03:52:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:52:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269957678] [2022-11-23 03:52:33,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269957678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:52:33,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141623732] [2022-11-23 03:52:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:52:33,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:52:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:52:33,208 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:52:33,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 03:52:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:52:33,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 03:52:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:52:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 03:52:33,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:52:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141623732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:52:33,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:52:33,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-23 03:52:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944970643] [2022-11-23 03:52:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:52:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:52:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:52:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:52:33,544 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:52:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:52:33,589 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-23 03:52:33,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2022-11-23 03:52:33,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-23 03:52:33,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-11-23 03:52:33,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-23 03:52:33,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-23 03:52:33,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-23 03:52:33,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:52:33,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 03:52:33,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 03:52:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:52:33,592 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 03:52:33,592 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-23 03:52:33,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-23 03:52:33,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-23 03:52:33,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-23 03:52:33,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:52:33 BoogieIcfgContainer [2022-11-23 03:52:33,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-23 03:52:33,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:52:33,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:52:33,600 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:52:33,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:39" (3/4) ... [2022-11-23 03:52:33,604 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:52:33,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:52:33,605 INFO L158 Benchmark]: Toolchain (without parser) took 55474.07ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.5MB in the beginning and 160.2MB in the end (delta: -20.7MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2022-11-23 03:52:33,606 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory was 104.3MB in the beginning and 104.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:52:33,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.90ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 138.9MB in the end (delta: 434.8kB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-11-23 03:52:33,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.01ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:52:33,607 INFO L158 Benchmark]: Boogie Preprocessor took 68.52ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 135.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:52:33,607 INFO L158 Benchmark]: RCFGBuilder took 631.33ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 118.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 03:52:33,607 INFO L158 Benchmark]: BuchiAutomizer took 54422.85ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 117.9MB in the beginning and 160.2MB in the end (delta: -42.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2022-11-23 03:52:33,608 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 247.5MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:52:33,609 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory was 104.3MB in the beginning and 104.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.90ms. Allocated memory is still 169.9MB. Free memory was 139.3MB in the beginning and 138.9MB in the end (delta: 434.8kB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.01ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 137.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.52ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 135.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 631.33ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 118.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 54422.85ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 117.9MB in the beginning and 160.2MB in the end (delta: -42.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 247.5MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 54.3s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 48.5s. Construction of modules took 1.7s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1004 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 1281 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 96 IncrementalHoareTripleChecker+Unchecked, 983 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 298 mSDtfsCounter, 1511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1502 mio100 ax100 hnf100 lsp97 ukn31 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf91 smp100 dnf113 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-23 03:52:33,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:33,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:34,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:34,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:34,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:34,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:34,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 03:52:35,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e006cd20-5ee2-4ce3-9b21-650e9a2083d6/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE