./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:49:15,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:49:15,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:49:15,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:49:15,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:49:15,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:49:15,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:49:15,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:49:15,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:49:15,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:49:15,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:49:15,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:49:15,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:49:15,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:49:15,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:49:15,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:49:15,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:49:15,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:49:15,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:49:15,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:49:15,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:49:15,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:49:15,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:49:15,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:49:15,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:49:15,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:49:15,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:49:15,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:49:15,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:49:15,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:49:15,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:49:15,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:49:15,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:49:15,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:49:15,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:49:15,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:49:15,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:49:15,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:49:15,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:49:15,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:49:15,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:49:15,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 20:49:16,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:49:16,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:49:16,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:49:16,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:49:16,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:49:16,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:49:16,020 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:49:16,021 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 20:49:16,021 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 20:49:16,021 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 20:49:16,021 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 20:49:16,021 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 20:49:16,022 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 20:49:16,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:49:16,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:49:16,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:49:16,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:49:16,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 20:49:16,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 20:49:16,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 20:49:16,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:49:16,023 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 20:49:16,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:49:16,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 20:49:16,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:49:16,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:49:16,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:49:16,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:49:16,026 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 20:49:16,026 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_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2022-12-13 20:49:16,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:49:16,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:49:16,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:49:16,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:49:16,243 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:49:16,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-15/array13_alloca.i [2022-12-13 20:49:18,752 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:49:18,931 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:49:18,931 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/sv-benchmarks/c/termination-15/array13_alloca.i [2022-12-13 20:49:18,937 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/data/eec9ec623/b6e0a56a4ed94024be722d547acc8db8/FLAG2df5952b6 [2022-12-13 20:49:19,310 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/data/eec9ec623/b6e0a56a4ed94024be722d547acc8db8 [2022-12-13 20:49:19,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:49:19,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:49:19,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:49:19,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:49:19,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:49:19,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308de778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19, skipping insertion in model container [2022-12-13 20:49:19,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:49:19,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:49:19,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:49:19,536 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:49:19,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:49:19,577 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:49:19,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19 WrapperNode [2022-12-13 20:49:19,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:49:19,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:49:19,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:49:19,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:49:19,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,605 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-13 20:49:19,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:49:19,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:49:19,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:49:19,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:49:19,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:49:19,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:49:19,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:49:19,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:49:19,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (1/1) ... [2022-12-13 20:49:19,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:19,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:19,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 20:49:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:49:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:49:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:49:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:49:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:49:19,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:49:19,744 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:49:19,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:49:19,827 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:49:19,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:49:19,832 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:49:19,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:49:19 BoogieIcfgContainer [2022-12-13 20:49:19,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:49:19,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 20:49:19,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 20:49:19,837 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 20:49:19,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:49:19,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 08:49:19" (1/3) ... [2022-12-13 20:49:19,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3092c717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:49:19, skipping insertion in model container [2022-12-13 20:49:19,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:49:19,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:49:19" (2/3) ... [2022-12-13 20:49:19,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3092c717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 08:49:19, skipping insertion in model container [2022-12-13 20:49:19,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 20:49:19,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:49:19" (3/3) ... [2022-12-13 20:49:19,841 INFO L332 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2022-12-13 20:49:19,882 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 20:49:19,882 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 20:49:19,882 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 20:49:19,882 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 20:49:19,882 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 20:49:19,882 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 20:49:19,882 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 20:49:19,883 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 20:49:19,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:19,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 20:49:19,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:19,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:19,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 20:49:19,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 20:49:19,905 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 20:49:19,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:19,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 20:49:19,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:19,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:19,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 20:49:19,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 20:49:19,913 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2022-12-13 20:49:19,913 INFO L750 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 4#L370-3true [2022-12-13 20:49:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-12-13 20:49:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891185554] [2022-12-13 20:49:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-12-13 20:49:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:20,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046447942] [2022-12-13 20:49:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:20,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-12-13 20:49:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:20,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87582156] [2022-12-13 20:49:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:20,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:20,357 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 20:49:20,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 20:49:20,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 20:49:20,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 20:49:20,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 20:49:20,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 20:49:20,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 20:49:20,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2022-12-13 20:49:20,359 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 20:49:20,359 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 20:49:20,372 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,486 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,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-12-13 20:49:20,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:20,686 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 20:49:20,689 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 20:49:20,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 20:49:20,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:20,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:20,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:20,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:20,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 20:49:20,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:20,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:20,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 20:49:20,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 20:49:20,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:20,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:20,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:20,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 20:49:20,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:20,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:20,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:20,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 20:49:20,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 20:49:20,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:20,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:20,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:20,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 20:49:20,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 20:49:20,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:20,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:20,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:20,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 20:49:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 20:49:20,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:20,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:20,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:20,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 20:49:20,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 20:49:20,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-12-13 20:49:20,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:20,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:20,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:20,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 20:49:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 20:49:20,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-12-13 20:49:20,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:20,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:20,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:20,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:20,897 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:20,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:20,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 20:49:20,950 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-12-13 20:49:20,950 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 20:49:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:20,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:20,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 20:49:20,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 20:49:20,998 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 20:49:20,998 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 20:49:20,999 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-12-13 20:49:21,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 20:49:21,013 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-12-13 20:49:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:21,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:49:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:21,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:49:21,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:21,119 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 20:49:21,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-12-13 20:49:21,158 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-12-13 20:49:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 20:49:21,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-12-13 20:49:21,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:21,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-12-13 20:49:21,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:21,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-12-13 20:49:21,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:21,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-12-13 20:49:21,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:21,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-12-13 20:49:21,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-12-13 20:49:21,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 20:49:21,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-12-13 20:49:21,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:21,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 20:49:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-12-13 20:49:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-13 20:49:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-12-13 20:49:21,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 20:49:21,189 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 20:49:21,189 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 20:49:21,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-12-13 20:49:21,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:21,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:21,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:21,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:21,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:21,190 INFO L748 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 120#L367 assume !(main_~length~0#1 < 1); 112#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 113#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 114#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 115#L370-4 main_~j~0#1 := 0; 116#L378-2 [2022-12-13 20:49:21,190 INFO L750 eck$LassoCheckResult]: Loop: 116#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 117#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 116#L378-2 [2022-12-13 20:49:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-12-13 20:49:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843691442] [2022-12-13 20:49:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:21,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843691442] [2022-12-13 20:49:21,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843691442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:49:21,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:49:21,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:49:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574876837] [2022-12-13 20:49:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:49:21,262 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:49:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-12-13 20:49:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042619092] [2022-12-13 20:49:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:21,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:21,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:49:21,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:49:21,320 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:21,345 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-12-13 20:49:21,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-12-13 20:49:21,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:21,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-12-13 20:49:21,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-12-13 20:49:21,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 20:49:21,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-12-13 20:49:21,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:21,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-12-13 20:49:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-12-13 20:49:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-12-13 20:49:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-12-13 20:49:21,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 20:49:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:49:21,349 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 20:49:21,349 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 20:49:21,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-12-13 20:49:21,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:21,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:21,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:21,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:21,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:21,350 INFO L748 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 153#L367 assume !(main_~length~0#1 < 1); 145#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 146#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 147#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 154#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 156#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 155#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 148#L370-4 main_~j~0#1 := 0; 149#L378-2 [2022-12-13 20:49:21,351 INFO L750 eck$LassoCheckResult]: Loop: 149#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 150#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 149#L378-2 [2022-12-13 20:49:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-12-13 20:49:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615160660] [2022-12-13 20:49:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-12-13 20:49:21,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870283962] [2022-12-13 20:49:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-12-13 20:49:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719946227] [2022-12-13 20:49:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:21,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719946227] [2022-12-13 20:49:21,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719946227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:21,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697039158] [2022-12-13 20:49:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:21,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:21,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:49:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:21,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 20:49:21,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:21,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:49:21,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:21,753 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-12-13 20:49:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:21,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:21,816 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 14 treesize of output 12 [2022-12-13 20:49:21,821 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 20 [2022-12-13 20:49:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:21,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697039158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:21,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:21,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-12-13 20:49:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423371919] [2022-12-13 20:49:21,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:21,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 20:49:21,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:49:21,869 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:21,966 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-12-13 20:49:21,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-12-13 20:49:21,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 20:49:21,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-12-13 20:49:21,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 20:49:21,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 20:49:21,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-12-13 20:49:21,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:21,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-12-13 20:49:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-12-13 20:49:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-12-13 20:49:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-12-13 20:49:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-12-13 20:49:21,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-12-13 20:49:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:49:21,971 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-12-13 20:49:21,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 20:49:21,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-12-13 20:49:21,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:21,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:21,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:21,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:21,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:21,973 INFO L748 eck$LassoCheckResult]: Stem: 275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 276#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 277#L367 assume !(main_~length~0#1 < 1); 269#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 270#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 271#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 278#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 283#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 279#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 280#L370-4 main_~j~0#1 := 0; 282#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 272#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 273#L378-2 [2022-12-13 20:49:21,973 INFO L750 eck$LassoCheckResult]: Loop: 273#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 284#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 273#L378-2 [2022-12-13 20:49:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-12-13 20:49:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509401863] [2022-12-13 20:49:21,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-12-13 20:49:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154818867] [2022-12-13 20:49:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:21,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2022-12-13 20:49:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612553212] [2022-12-13 20:49:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:22,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612553212] [2022-12-13 20:49:22,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612553212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:22,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945593885] [2022-12-13 20:49:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:22,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:22,061 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:22,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:49:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:49:22,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945593885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:22,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 20:49:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574826663] [2022-12-13 20:49:22,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:49:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:49:22,207 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:22,283 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-12-13 20:49:22,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-12-13 20:49:22,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 20:49:22,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2022-12-13 20:49:22,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-12-13 20:49:22,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-12-13 20:49:22,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-12-13 20:49:22,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:22,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-12-13 20:49:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-12-13 20:49:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-12-13 20:49:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-12-13 20:49:22,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-12-13 20:49:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:49:22,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-12-13 20:49:22,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 20:49:22,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2022-12-13 20:49:22,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 20:49:22,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:22,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:22,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:22,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:22,292 INFO L748 eck$LassoCheckResult]: Stem: 444#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 445#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 442#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 435#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 436#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 437#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 467#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 465#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 466#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 464#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 462#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 459#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 438#L370-4 main_~j~0#1 := 0; 439#L378-2 [2022-12-13 20:49:22,292 INFO L750 eck$LassoCheckResult]: Loop: 439#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 451#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 439#L378-2 [2022-12-13 20:49:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-12-13 20:49:22,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264390399] [2022-12-13 20:49:22,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264390399] [2022-12-13 20:49:22,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264390399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441369239] [2022-12-13 20:49:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:22,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:22,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:49:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:49:22,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:49:22,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441369239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:49:22,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:49:22,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 20:49:22,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249601250] [2022-12-13 20:49:22,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:49:22,409 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:49:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-12-13 20:49:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277023421] [2022-12-13 20:49:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:49:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:49:22,451 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:22,467 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-12-13 20:49:22,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2022-12-13 20:49:22,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:22,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2022-12-13 20:49:22,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-12-13 20:49:22,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-12-13 20:49:22,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-12-13 20:49:22,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:22,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 20:49:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-12-13 20:49:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-13 20:49:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-12-13 20:49:22,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 20:49:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:49:22,471 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 20:49:22,472 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 20:49:22,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-12-13 20:49:22,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:22,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:22,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:22,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:22,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:22,473 INFO L748 eck$LassoCheckResult]: Stem: 548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 549#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 550#L367 assume !(main_~length~0#1 < 1); 542#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 543#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 544#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 551#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 554#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 552#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 553#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 561#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 558#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 545#L370-4 main_~j~0#1 := 0; 546#L378-2 [2022-12-13 20:49:22,473 INFO L750 eck$LassoCheckResult]: Loop: 546#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 555#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 546#L378-2 [2022-12-13 20:49:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2022-12-13 20:49:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112616524] [2022-12-13 20:49:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-12-13 20:49:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118074199] [2022-12-13 20:49:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:22,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2022-12-13 20:49:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:22,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134734876] [2022-12-13 20:49:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134734876] [2022-12-13 20:49:22,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134734876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283792870] [2022-12-13 20:49:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:22,729 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:22,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:49:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:22,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 20:49:22,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:22,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:22,833 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 23 treesize of output 22 [2022-12-13 20:49:22,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:22,848 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 23 treesize of output 22 [2022-12-13 20:49:22,878 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-12-13 20:49:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:22,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:23,047 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 21 treesize of output 19 [2022-12-13 20:49:23,050 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 56 treesize of output 54 [2022-12-13 20:49:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283792870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:23,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:23,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 20:49:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770467570] [2022-12-13 20:49:23,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 20:49:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-13 20:49:23,112 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:23,209 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-12-13 20:49:23,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-12-13 20:49:23,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:23,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2022-12-13 20:49:23,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 20:49:23,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 20:49:23,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2022-12-13 20:49:23,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:23,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-12-13 20:49:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2022-12-13 20:49:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-12-13 20:49:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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-12-13 20:49:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-12-13 20:49:23,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-13 20:49:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:49:23,213 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-13 20:49:23,213 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 20:49:23,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2022-12-13 20:49:23,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:23,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:23,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:23,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:23,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:23,214 INFO L748 eck$LassoCheckResult]: Stem: 706#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 707#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 705#L367 assume !(main_~length~0#1 < 1); 698#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 699#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 700#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 708#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 713#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 709#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 710#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 711#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 712#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 701#L370-4 main_~j~0#1 := 0; 702#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 703#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 704#L378-2 [2022-12-13 20:49:23,214 INFO L750 eck$LassoCheckResult]: Loop: 704#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 714#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 704#L378-2 [2022-12-13 20:49:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2022-12-13 20:49:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968105035] [2022-12-13 20:49:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-12-13 20:49:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029952206] [2022-12-13 20:49:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2022-12-13 20:49:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530112490] [2022-12-13 20:49:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530112490] [2022-12-13 20:49:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530112490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574437993] [2022-12-13 20:49:23,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:49:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:23,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:23,389 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:23,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 20:49:23,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:49:23,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:23,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 20:49:23,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:23,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 20:49:23,548 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-12-13 20:49:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:23,604 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 16 treesize of output 14 [2022-12-13 20:49:23,607 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 20 [2022-12-13 20:49:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574437993] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:23,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:23,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 20:49:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562223627] [2022-12-13 20:49:23,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 20:49:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-12-13 20:49:23,654 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:23,774 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-12-13 20:49:23,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-12-13 20:49:23,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 20:49:23,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 20:49:23,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-12-13 20:49:23,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-12-13 20:49:23,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-12-13 20:49:23,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:23,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 20:49:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-12-13 20:49:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-12-13 20:49:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-12-13 20:49:23,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-12-13 20:49:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:49:23,777 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-12-13 20:49:23,778 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 20:49:23,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-12-13 20:49:23,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:23,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:23,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:23,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:23,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:23,778 INFO L748 eck$LassoCheckResult]: Stem: 878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 880#L367 assume !(main_~length~0#1 < 1); 872#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 873#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 874#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 881#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 889#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 882#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 883#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 884#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 886#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 887#L370-4 main_~j~0#1 := 0; 892#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 877#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 876#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L378-2 [2022-12-13 20:49:23,779 INFO L750 eck$LassoCheckResult]: Loop: 891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 890#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 891#L378-2 [2022-12-13 20:49:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2022-12-13 20:49:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300213791] [2022-12-13 20:49:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-12-13 20:49:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853455364] [2022-12-13 20:49:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:23,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2022-12-13 20:49:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:23,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366244948] [2022-12-13 20:49:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366244948] [2022-12-13 20:49:23,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366244948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237683621] [2022-12-13 20:49:23,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:49:23,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:23,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:23,862 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:23,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 20:49:23,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 20:49:23,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:23,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 20:49:23,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:23,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237683621] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:24,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:24,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 20:49:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000834274] [2022-12-13 20:49:24,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:24,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 20:49:24,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:49:24,041 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:24,109 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-12-13 20:49:24,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-12-13 20:49:24,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:24,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2022-12-13 20:49:24,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 20:49:24,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 20:49:24,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-12-13 20:49:24,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:24,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 20:49:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-12-13 20:49:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-12-13 20:49:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-13 20:49:24,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-13 20:49:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:49:24,114 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-13 20:49:24,114 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 20:49:24,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-12-13 20:49:24,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:24,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:24,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:24,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:24,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:24,115 INFO L748 eck$LassoCheckResult]: Stem: 1074#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1075#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1073#L367 assume !(main_~length~0#1 < 1); 1066#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1067#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1068#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1076#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1079#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1080#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1090#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1091#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1077#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1078#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1089#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1081#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1082#L370-4 main_~j~0#1 := 0; 1072#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1088#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1087#L378-2 [2022-12-13 20:49:24,115 INFO L750 eck$LassoCheckResult]: Loop: 1087#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1086#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1087#L378-2 [2022-12-13 20:49:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2022-12-13 20:49:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:24,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912465885] [2022-12-13 20:49:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:24,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:24,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-12-13 20:49:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:24,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066256272] [2022-12-13 20:49:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:24,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:24,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2022-12-13 20:49:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381540778] [2022-12-13 20:49:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:24,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381540778] [2022-12-13 20:49:24,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381540778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:24,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208043175] [2022-12-13 20:49:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:24,384 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:24,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 20:49:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:24,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 20:49:24,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:24,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:24,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 20:49:24,543 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 23 treesize of output 22 [2022-12-13 20:49:24,610 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-12-13 20:49:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:24,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:24,706 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 23 treesize of output 21 [2022-12-13 20:49:24,709 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 31 treesize of output 27 [2022-12-13 20:49:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:24,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208043175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:24,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:24,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-12-13 20:49:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388422174] [2022-12-13 20:49:24,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:24,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 20:49:24,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-13 20:49:24,754 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:25,012 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-12-13 20:49:25,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2022-12-13 20:49:25,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-12-13 20:49:25,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2022-12-13 20:49:25,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-12-13 20:49:25,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-12-13 20:49:25,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2022-12-13 20:49:25,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:25,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2022-12-13 20:49:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2022-12-13 20:49:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2022-12-13 20:49:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-12-13 20:49:25,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-12-13 20:49:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 20:49:25,020 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-12-13 20:49:25,020 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 20:49:25,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2022-12-13 20:49:25,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:25,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:25,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:25,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:25,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:25,021 INFO L748 eck$LassoCheckResult]: Stem: 1339#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1341#L367 assume !(main_~length~0#1 < 1); 1333#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1334#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1335#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1342#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1348#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1349#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1355#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1356#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1343#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1344#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1346#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1373#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1351#L370-4 main_~j~0#1 := 0; 1359#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1336#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1337#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1345#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1358#L378-2 [2022-12-13 20:49:25,022 INFO L750 eck$LassoCheckResult]: Loop: 1358#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1357#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1358#L378-2 [2022-12-13 20:49:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2022-12-13 20:49:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746428389] [2022-12-13 20:49:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-12-13 20:49:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984430313] [2022-12-13 20:49:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2022-12-13 20:49:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109862033] [2022-12-13 20:49:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109862033] [2022-12-13 20:49:25,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109862033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882808103] [2022-12-13 20:49:25,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:49:25,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:25,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:25,188 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:25,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 20:49:25,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:49:25,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:25,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 20:49:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:25,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 20:49:25,389 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-12-13 20:49:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:25,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:25,471 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 16 treesize of output 14 [2022-12-13 20:49:25,474 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 20 [2022-12-13 20:49:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:25,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882808103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:25,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:25,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-12-13 20:49:25,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372732441] [2022-12-13 20:49:25,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 20:49:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-12-13 20:49:25,528 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 20 Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:25,731 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-12-13 20:49:25,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2022-12-13 20:49:25,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 20:49:25,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2022-12-13 20:49:25,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-12-13 20:49:25,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-12-13 20:49:25,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2022-12-13 20:49:25,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:25,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-12-13 20:49:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2022-12-13 20:49:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-12-13 20:49:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 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-12-13 20:49:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-12-13 20:49:25,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-12-13 20:49:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:49:25,736 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-12-13 20:49:25,736 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 20:49:25,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2022-12-13 20:49:25,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 20:49:25,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:25,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:25,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:25,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:25,738 INFO L748 eck$LassoCheckResult]: Stem: 1597#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1599#L367 assume !(main_~length~0#1 < 1); 1591#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1593#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1600#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1611#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1612#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1601#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1602#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1604#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1634#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1594#L370-4 main_~j~0#1 := 0; 1595#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1618#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1616#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1615#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1610#L378-2 [2022-12-13 20:49:25,738 INFO L750 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2022-12-13 20:49:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2022-12-13 20:49:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724047829] [2022-12-13 20:49:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-12-13 20:49:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249880192] [2022-12-13 20:49:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:25,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2022-12-13 20:49:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607812224] [2022-12-13 20:49:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:25,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:25,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607812224] [2022-12-13 20:49:25,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607812224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:25,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084041342] [2022-12-13 20:49:25,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:49:25,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:25,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:25,924 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:25,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 20:49:25,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:49:25,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:25,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 20:49:25,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:25,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:26,060 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 19 treesize of output 7 [2022-12-13 20:49:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:26,110 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 16 treesize of output 14 [2022-12-13 20:49:26,112 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 20 [2022-12-13 20:49:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084041342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:26,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:26,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-12-13 20:49:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305930421] [2022-12-13 20:49:26,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 20:49:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:49:26,155 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. cyclomatic complexity: 20 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:26,249 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-12-13 20:49:26,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-12-13 20:49:26,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-12-13 20:49:26,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-12-13 20:49:26,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 20:49:26,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 20:49:26,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-12-13 20:49:26,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:26,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-13 20:49:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-12-13 20:49:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-12-13 20:49:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2022-12-13 20:49:26,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-12-13 20:49:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 20:49:26,255 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2022-12-13 20:49:26,255 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 20:49:26,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2022-12-13 20:49:26,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:26,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:26,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:26,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:26,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:26,256 INFO L748 eck$LassoCheckResult]: Stem: 1863#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1865#L367 assume !(main_~length~0#1 < 1); 1857#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1858#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1859#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1866#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1876#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1877#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1878#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1879#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1867#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1868#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1903#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1902#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1875#L370-4 main_~j~0#1 := 0; 1909#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1862#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1861#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1872#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1885#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1883#L378-2 [2022-12-13 20:49:26,256 INFO L750 eck$LassoCheckResult]: Loop: 1883#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1884#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1883#L378-2 [2022-12-13 20:49:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2022-12-13 20:49:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869873589] [2022-12-13 20:49:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-12-13 20:49:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033727866] [2022-12-13 20:49:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2022-12-13 20:49:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611568622] [2022-12-13 20:49:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:26,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611568622] [2022-12-13 20:49:26,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611568622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:26,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061868189] [2022-12-13 20:49:26,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:49:26,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:26,352 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:26,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 20:49:26,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 20:49:26,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:26,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 20:49:26,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061868189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:26,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:26,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 20:49:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286665561] [2022-12-13 20:49:26,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 20:49:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:49:26,544 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. cyclomatic complexity: 29 Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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-12-13 20:49:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:26,618 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-12-13 20:49:26,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2022-12-13 20:49:26,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:26,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2022-12-13 20:49:26,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-12-13 20:49:26,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-12-13 20:49:26,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2022-12-13 20:49:26,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:26,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 20:49:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2022-12-13 20:49:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 20:49:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-12-13 20:49:26,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 20:49:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:49:26,624 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 20:49:26,624 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 20:49:26,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-12-13 20:49:26,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:26,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:26,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:26,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:26,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:26,625 INFO L748 eck$LassoCheckResult]: Stem: 2160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2162#L367 assume !(main_~length~0#1 < 1); 2153#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2154#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2155#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2163#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2166#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2164#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2165#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2211#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2209#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2208#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2206#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2204#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2201#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2200#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2198#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2188#L370-4 main_~j~0#1 := 0; 2159#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2181#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2171#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2175#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2174#L378-2 [2022-12-13 20:49:26,626 INFO L750 eck$LassoCheckResult]: Loop: 2174#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2173#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2174#L378-2 [2022-12-13 20:49:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2022-12-13 20:49:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235479479] [2022-12-13 20:49:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-12-13 20:49:26,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92147199] [2022-12-13 20:49:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:26,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2022-12-13 20:49:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:26,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680824601] [2022-12-13 20:49:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680824601] [2022-12-13 20:49:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680824601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733960967] [2022-12-13 20:49:26,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:49:26,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:26,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:26,838 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:26,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 20:49:26,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:49:26,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:26,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 20:49:26,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:26,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:26,965 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 20:49:26,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-12-13 20:49:26,985 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-13 20:49:26,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-12-13 20:49:27,101 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 20:49:27,101 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 21 treesize of output 10 [2022-12-13 20:49:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:27,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:27,310 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 23 treesize of output 21 [2022-12-13 20:49:27,313 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 58 treesize of output 54 [2022-12-13 20:49:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733960967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:27,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-12-13 20:49:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028101833] [2022-12-13 20:49:27,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 20:49:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-12-13 20:49:27,367 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:27,604 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2022-12-13 20:49:27,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2022-12-13 20:49:27,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-12-13 20:49:27,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2022-12-13 20:49:27,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-12-13 20:49:27,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-12-13 20:49:27,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2022-12-13 20:49:27,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:27,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2022-12-13 20:49:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2022-12-13 20:49:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2022-12-13 20:49:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-12-13 20:49:27,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 20:49:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:49:27,610 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-12-13 20:49:27,610 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 20:49:27,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2022-12-13 20:49:27,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:27,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:27,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:27,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:27,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:27,612 INFO L748 eck$LassoCheckResult]: Stem: 2493#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2495#L367 assume !(main_~length~0#1 < 1); 2486#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2487#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2488#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2496#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2512#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2507#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2506#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2501#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2502#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2510#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2511#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2497#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2498#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2499#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2503#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2504#L370-4 main_~j~0#1 := 0; 2490#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2534#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2515#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2518#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2516#L378-2 [2022-12-13 20:49:27,612 INFO L750 eck$LassoCheckResult]: Loop: 2516#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2517#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2516#L378-2 [2022-12-13 20:49:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2022-12-13 20:49:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:27,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880337579] [2022-12-13 20:49:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:27,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:27,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2022-12-13 20:49:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:27,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575518025] [2022-12-13 20:49:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:27,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:27,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2022-12-13 20:49:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799344557] [2022-12-13 20:49:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:27,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799344557] [2022-12-13 20:49:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799344557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:27,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326412300] [2022-12-13 20:49:27,838 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:49:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:27,840 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:27,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 20:49:27,896 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-13 20:49:27,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:27,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 20:49:27,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:27,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:28,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:28,016 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 25 treesize of output 24 [2022-12-13 20:49:28,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:28,027 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 25 treesize of output 24 [2022-12-13 20:49:28,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:49:28,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:49:28,144 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 17 treesize of output 10 [2022-12-13 20:49:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:28,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:28,283 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 21 treesize of output 19 [2022-12-13 20:49:28,285 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 29 treesize of output 25 [2022-12-13 20:49:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:28,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326412300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:28,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:28,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2022-12-13 20:49:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863091827] [2022-12-13 20:49:28,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 20:49:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-12-13 20:49:28,335 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:28,633 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-12-13 20:49:28,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2022-12-13 20:49:28,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-12-13 20:49:28,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2022-12-13 20:49:28,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 20:49:28,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 20:49:28,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2022-12-13 20:49:28,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:28,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-12-13 20:49:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2022-12-13 20:49:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2022-12-13 20:49:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-12-13 20:49:28,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-12-13 20:49:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:49:28,637 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-12-13 20:49:28,637 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 20:49:28,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2022-12-13 20:49:28,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:28,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:28,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:28,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:28,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:28,638 INFO L748 eck$LassoCheckResult]: Stem: 2814#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2816#L367 assume !(main_~length~0#1 < 1); 2807#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2808#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2809#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2817#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2828#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2829#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2830#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2826#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2827#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2833#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2834#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2818#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2819#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2855#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2846#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2810#L370-4 main_~j~0#1 := 0; 2811#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2812#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2813#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2844#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2837#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2839#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2840#L378-2 [2022-12-13 20:49:28,638 INFO L750 eck$LassoCheckResult]: Loop: 2840#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2841#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2840#L378-2 [2022-12-13 20:49:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2022-12-13 20:49:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333619779] [2022-12-13 20:49:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:28,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:28,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2022-12-13 20:49:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:28,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015381108] [2022-12-13 20:49:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:28,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:28,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2022-12-13 20:49:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:28,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105728335] [2022-12-13 20:49:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:28,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105728335] [2022-12-13 20:49:28,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105728335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:28,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641807883] [2022-12-13 20:49:28,820 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:49:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:28,821 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:28,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 20:49:28,887 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 20:49:28,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:28,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 20:49:28,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:28,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:29,178 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 20:49:29,178 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 23 treesize of output 10 [2022-12-13 20:49:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:29,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:29,490 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 18 treesize of output 16 [2022-12-13 20:49:29,493 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 30 treesize of output 24 [2022-12-13 20:49:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:29,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641807883] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:29,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:29,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-12-13 20:49:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558587155] [2022-12-13 20:49:29,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 20:49:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 20:49:29,559 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 21 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 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-12-13 20:49:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:30,787 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-12-13 20:49:30,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-12-13 20:49:30,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-12-13 20:49:30,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2022-12-13 20:49:30,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-12-13 20:49:30,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-12-13 20:49:30,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2022-12-13 20:49:30,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:30,788 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-12-13 20:49:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2022-12-13 20:49:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2022-12-13 20:49:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-12-13 20:49:30,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-12-13 20:49:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 20:49:30,790 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-12-13 20:49:30,790 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 20:49:30,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2022-12-13 20:49:30,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:30,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:30,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:30,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:30,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:30,791 INFO L748 eck$LassoCheckResult]: Stem: 3165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3167#L367 assume !(main_~length~0#1 < 1); 3159#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3160#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3161#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3168#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3185#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3180#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3179#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3174#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3175#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3183#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3184#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3169#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3170#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3172#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3176#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3162#L370-4 main_~j~0#1 := 0; 3163#L378-2 [2022-12-13 20:49:30,791 INFO L750 eck$LassoCheckResult]: Loop: 3163#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3164#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3163#L378-2 [2022-12-13 20:49:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2022-12-13 20:49:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193660620] [2022-12-13 20:49:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-12-13 20:49:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033056365] [2022-12-13 20:49:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2022-12-13 20:49:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193298389] [2022-12-13 20:49:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:30,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:31,569 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 20:49:31,569 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 20:49:31,569 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 20:49:31,569 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 20:49:31,569 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 20:49:31,569 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:31,569 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 20:49:31,569 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 20:49:31,569 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration16_Lasso [2022-12-13 20:49:31,569 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 20:49:31,569 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 20:49:31,570 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,572 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,574 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,576 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,755 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 20:49:31,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 20:49:31,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 20:49:31,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:31,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:31,949 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:31,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 20:49:31,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:31,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:31,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:31,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:31,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:31,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:31,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:31,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:31,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:31,968 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:31,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 20:49:31,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:31,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:31,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 20:49:31,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:31,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:31,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:31,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 20:49:31,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 20:49:31,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:31,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-12-13 20:49:31,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:31,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:31,985 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:31,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 20:49:31,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:31,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:31,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:31,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:31,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:31,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:31,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-12-13 20:49:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,005 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 20:49:32,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-12-13 20:49:32,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,027 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 20:49:32,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-12-13 20:49:32,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,048 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 20:49:32,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-12-13 20:49:32,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,068 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 20:49:32,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 20:49:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,089 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 20:49:32,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,109 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 20:49:32,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-12-13 20:49:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,129 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 20:49:32,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 20:49:32,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:32,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,149 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 20:49:32,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 20:49:32,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 20:49:32,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 20:49:32,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 20:49:32,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 20:49:32,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 20:49:32,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 20:49:32,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 20:49:32,195 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 20:49:32,195 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-12-13 20:49:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 20:49:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,196 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 20:49:32,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 20:49:32,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 20:49:32,208 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 20:49:32,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-12-13 20:49:32,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-12-13 20:49:32,226 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-12-13 20:49:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:49:32,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 20:49:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:32,283 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 20:49:32,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:32,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 51 states and 69 transitions. Complement of second has 5 states. [2022-12-13 20:49:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-12-13 20:49:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-12-13 20:49:32,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2022-12-13 20:49:32,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:32,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2022-12-13 20:49:32,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:32,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2022-12-13 20:49:32,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 20:49:32,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2022-12-13 20:49:32,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:32,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2022-12-13 20:49:32,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-12-13 20:49:32,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-12-13 20:49:32,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2022-12-13 20:49:32,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:32,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 20:49:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2022-12-13 20:49:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-13 20:49:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-12-13 20:49:32,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 20:49:32,297 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-12-13 20:49:32,297 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-12-13 20:49:32,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2022-12-13 20:49:32,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-12-13 20:49:32,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 20:49:32,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 20:49:32,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:32,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 20:49:32,298 INFO L748 eck$LassoCheckResult]: Stem: 3371#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3373#L367 assume !(main_~length~0#1 < 1); 3364#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3365#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3366#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3374#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3402#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3375#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3376#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3377#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3380#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3401#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3400#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3398#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3396#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3394#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3392#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3390#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3388#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3387#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3382#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3383#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3381#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3367#L370-4 main_~j~0#1 := 0; 3368#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3405#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3406#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3403#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-12-13 20:49:32,298 INFO L750 eck$LassoCheckResult]: Loop: 3378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3379#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3378#L378-2 [2022-12-13 20:49:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:32,298 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2022-12-13 20:49:32,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:32,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011749960] [2022-12-13 20:49:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-12-13 20:49:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:32,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011749960] [2022-12-13 20:49:32,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011749960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:32,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219258984] [2022-12-13 20:49:32,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 20:49:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:32,634 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:32,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 20:49:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 20:49:32,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:32,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:49:32,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 20:49:32,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 20:49:32,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 20:49:32,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:32,887 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 25 treesize of output 24 [2022-12-13 20:49:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:49:32,920 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 25 treesize of output 24 [2022-12-13 20:49:32,994 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-12-13 20:49:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:49:32,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:33,206 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 21 treesize of output 19 [2022-12-13 20:49:33,208 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 29 treesize of output 25 [2022-12-13 20:49:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 20:49:33,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219258984] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:33,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:33,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2022-12-13 20:49:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779689277] [2022-12-13 20:49:33,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:33,221 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 20:49:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2022-12-13 20:49:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851917284] [2022-12-13 20:49:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:33,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:49:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:49:33,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:49:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:33,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 20:49:33,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-12-13 20:49:33,261 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:49:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:33,473 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-12-13 20:49:33,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-12-13 20:49:33,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 20:49:33,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-12-13 20:49:33,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 20:49:33,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 20:49:33,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 20:49:33,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:49:33,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:49:33,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:49:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:49:33,475 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:49:33,475 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-12-13 20:49:33,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 20:49:33,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 20:49:33,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 20:49:33,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 08:49:33 BoogieIcfgContainer [2022-12-13 20:49:33,481 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 20:49:33,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:49:33,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:49:33,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:49:33,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:49:19" (3/4) ... [2022-12-13 20:49:33,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 20:49:33,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:49:33,485 INFO L158 Benchmark]: Toolchain (without parser) took 14171.03ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 97.0MB in the beginning and 146.8MB in the end (delta: -49.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-12-13 20:49:33,485 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:49:33,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.27ms. Allocated memory is still 130.0MB. Free memory was 97.0MB in the beginning and 79.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:49:33,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.90ms. Allocated memory is still 130.0MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:49:33,486 INFO L158 Benchmark]: Boogie Preprocessor took 15.56ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 76.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:49:33,486 INFO L158 Benchmark]: RCFGBuilder took 211.93ms. Allocated memory is still 130.0MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:49:33,487 INFO L158 Benchmark]: BuchiAutomizer took 13647.00ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 66.0MB in the beginning and 147.9MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:49:33,487 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 146.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:49:33,488 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.21ms. Allocated memory is still 130.0MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.27ms. Allocated memory is still 130.0MB. Free memory was 97.0MB in the beginning and 79.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.90ms. Allocated memory is still 130.0MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.56ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 76.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 211.93ms. Allocated memory is still 130.0MB. Free memory was 76.5MB in the beginning and 66.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 13647.00ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 66.0MB in the beginning and 147.9MB in the end (delta: -81.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 192.9MB. Free memory was 147.9MB in the beginning and 146.8MB in the end (delta: 1.1MB). 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 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[arr] + -1 * arr and consists of 5 locations. One deterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr] + -1 * arr and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 10.1s. Construction of modules took 1.4s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 152 StatesRemovedByMinimization, 12 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, 676 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 957 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2903 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 160 mSDtfsCounter, 2903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc12 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp93 ukn83 mio100 lsp58 div163 bol100 ite100 ukn100 eq150 hnf93 smp73 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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-12-13 20:49:33,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-13 20:49:33,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 20:49:33,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:34,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 20:49:34,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:34,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 20:49:34,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:34,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 20:49:35,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:35,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 20:49:35,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 20:49:35,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:49:35,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 20:49:36,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:49:36,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a662dce0-6c2e-4333-9643-6840367f4418/bin/uautomizer-uyxdKDjOR8/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