./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_fixed.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_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/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_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/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_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/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 2a580f3a42bca030605af1bbd4c6a77550e46d88a6197c1e34cf45bb050eadef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:58:43,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:58:43,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:58:43,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:58:43,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:58:43,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:58:43,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:58:43,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:58:43,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:58:43,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:58:43,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:58:43,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:58:43,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:58:43,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:58:43,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:58:43,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:58:43,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:58:43,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:58:43,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:58:43,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:58:43,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:58:43,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:58:43,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:58:43,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:58:43,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:58:43,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:58:43,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:58:43,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:58:43,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:58:43,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:58:43,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:58:43,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:58:43,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:58:43,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:58:43,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:58:43,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:58:43,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:58:43,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:58:43,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:58:43,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:58:43,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:58:43,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 13:58:43,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:58:43,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:58:43,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:58:43,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:58:43,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:58:43,270 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 13:58:43,270 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 13:58:43,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:58:43,271 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 13:58:43,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:58:43,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 13:58:43,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:58:43,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:58:43,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:58:43,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:58:43,273 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 13:58:43,273 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_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/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_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/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 -> 2a580f3a42bca030605af1bbd4c6a77550e46d88a6197c1e34cf45bb050eadef [2022-12-13 13:58:43,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:58:43,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:58:43,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:58:43,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:58:43,452 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:58:43,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2022-12-13 13:58:46,101 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:58:46,288 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:58:46,289 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/sv-benchmarks/c/termination-15/array16_alloca_fixed.i [2022-12-13 13:58:46,296 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/data/860a848c5/58823dde946a4ce585f2146bb269ee96/FLAGf00cda087 [2022-12-13 13:58:46,307 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/data/860a848c5/58823dde946a4ce585f2146bb269ee96 [2022-12-13 13:58:46,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:58:46,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:58:46,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:58:46,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:58:46,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:58:46,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b49a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46, skipping insertion in model container [2022-12-13 13:58:46,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:58:46,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:58:46,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:58:46,581 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:58:46,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:58:46,634 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:58:46,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46 WrapperNode [2022-12-13 13:58:46,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:58:46,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:58:46,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:58:46,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:58:46,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,665 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-13 13:58:46,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:58:46,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:58:46,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:58:46,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:58:46,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:58:46,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:58:46,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:58:46,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:58:46,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (1/1) ... [2022-12-13 13:58:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:46,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:46,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:46,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 13:58:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:58:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:58:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:58:46,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:58:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:58:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:58:46,815 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:58:46,817 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:58:46,932 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:58:46,936 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:58:46,936 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 13:58:46,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:58:46 BoogieIcfgContainer [2022-12-13 13:58:46,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:58:46,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 13:58:46,939 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 13:58:46,941 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 13:58:46,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:58:46,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 01:58:46" (1/3) ... [2022-12-13 13:58:46,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ec3a6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:58:46, skipping insertion in model container [2022-12-13 13:58:46,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:58:46,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:58:46" (2/3) ... [2022-12-13 13:58:46,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ec3a6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 01:58:46, skipping insertion in model container [2022-12-13 13:58:46,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 13:58:46,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:58:46" (3/3) ... [2022-12-13 13:58:46,944 INFO L332 chiAutomizerObserver]: Analyzing ICFG array16_alloca_fixed.i [2022-12-13 13:58:46,984 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 13:58:46,984 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 13:58:46,984 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 13:58:46,984 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 13:58:46,985 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 13:58:46,985 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 13:58:46,985 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 13:58:46,985 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 13:58:46,988 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 13:58:47,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 13:58:47,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:47,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:47,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 13:58:47,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:58:47,005 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 13:58:47,005 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 13:58:47,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-12-13 13:58:47,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:47,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:47,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 13:58:47,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 13:58:47,012 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 13:58:47,013 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 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);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 13:58:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-12-13 13:58:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:47,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829311321] [2022-12-13 13:58:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-12-13 13:58:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:47,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009605969] [2022-12-13 13:58:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-12-13 13:58:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:47,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213547737] [2022-12-13 13:58:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:47,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:47,427 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:58:47,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:58:47,428 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:58:47,428 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:58:47,428 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:58:47,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,428 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:58:47,428 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:58:47,428 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration1_Lasso [2022-12-13 13:58:47,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:58:47,429 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:58:47,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,457 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,582 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,584 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,585 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,589 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,591 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:47,806 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:58:47,809 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:58:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 13:58:47,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:47,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:47,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:47,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:47,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 13:58:47,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:47,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:47,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 13:58:47,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 13:58:47,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:47,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:47,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:47,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:47,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 13:58:47,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:47,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:47,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:47,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:47,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,897 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 13:58:47,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:47,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:47,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:47,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 13:58:47,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:47,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:47,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:47,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 13:58:47,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 13:58:47,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:47,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:47,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 13:58:47,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:47,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:47,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:47,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:47,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 13:58:47,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:47,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:47,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 13:58:47,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:47,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:47,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:47,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:47,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:48,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:48,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:48,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:58:48,067 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-12-13 13:58:48,067 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 13:58:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:48,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:48,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 13:58:48,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:58:48,115 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:58:48,115 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:58:48,116 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1) = -4*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 Supporting invariants [] [2022-12-13 13:58:48,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 13:58:48,130 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-12-13 13:58:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:48,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:58:48,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:48,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:58:48,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:48,239 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 13:58:48,241 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 13:58:48,282 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 13:58:48,284 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 13:58:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 13:58:48,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-12-13 13:58:48,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:48,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-12-13 13:58:48,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:48,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-12-13 13:58:48,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:48,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2022-12-13 13:58:48,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:48,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-12-13 13:58:48,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-12-13 13:58:48,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 13:58:48,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-12-13 13:58:48,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:58:48,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 13:58:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-12-13 13:58:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-13 13:58:48,318 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 13:58:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-12-13 13:58:48,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 13:58:48,319 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-12-13 13:58:48,319 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 13:58:48,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-12-13 13:58:48,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:48,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:48,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:48,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:48,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:48,321 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 13:58:48,321 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 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 116#L378-2 [2022-12-13 13:58:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-12-13 13:58:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:48,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702481331] [2022-12-13 13:58:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:48,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702481331] [2022-12-13 13:58:48,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702481331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:48,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:58:48,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:58:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446201241] [2022-12-13 13:58:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:48,393 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-12-13 13:58:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:48,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652789421] [2022-12-13 13:58:48,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:58:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:58:48,452 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 13:58:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:48,474 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-12-13 13:58:48,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-12-13 13:58:48,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:48,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-12-13 13:58:48,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-12-13 13:58:48,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-12-13 13:58:48,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-12-13 13:58:48,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:58:48,475 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-12-13 13:58:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-12-13 13:58:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-12-13 13:58:48,476 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 13:58:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-12-13 13:58:48,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 13:58:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:58:48,477 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-13 13:58:48,477 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 13:58:48,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-12-13 13:58:48,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:48,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:48,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:48,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:48,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:48,478 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 !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));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 13:58:48,478 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 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 149#L378-2 [2022-12-13 13:58:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-12-13 13:58:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:48,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897963383] [2022-12-13 13:58:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-12-13 13:58:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:48,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451084057] [2022-12-13 13:58:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-12-13 13:58:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:48,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796875062] [2022-12-13 13:58:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:48,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:48,804 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 13:58:48,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 13:58:48,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 13:58:48,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 13:58:48,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 13:58:48,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:48,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 13:58:48,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 13:58:48,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_fixed.i_Iteration3_Lasso [2022-12-13 13:58:48,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 13:58:48,805 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 13:58:48,808 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,810 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,812 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,814 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:48,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,951 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:48,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 13:58:49,201 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 13:58:49,201 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 13:58:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 13:58:49,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:49,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:49,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:49,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:49,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:49,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:49,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:49,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:49,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:49,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 13:58:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,220 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 13:58:49,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:49,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:49,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:49,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:49,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:49,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:49,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:49,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:49,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:49,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 13:58:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,238 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 13:58:49,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:49,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:49,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:49,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:49,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:49,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:49,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:49,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:49,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 13:58:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,259 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 13:58:49,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:49,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:49,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 13:58:49,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:49,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:49,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:49,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 13:58:49,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 13:58:49,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 13:58:49,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,277 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 13:58:49,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 13:58:49,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 13:58:49,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 13:58:49,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 13:58:49,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 13:58:49,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 13:58:49,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 13:58:49,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 13:58:49,332 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-12-13 13:58:49,333 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-12-13 13:58:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 13:58:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,334 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 13:58:49,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 13:58:49,347 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 13:58:49,347 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 13:58:49,347 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-12-13 13:58:49,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 13:58:49,358 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-12-13 13:58:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:49,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:58:49,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:49,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:58:49,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:49,406 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 13:58:49,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:49,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 5 states. [2022-12-13 13:58:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-12-13 13:58:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-12-13 13:58:49,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2022-12-13 13:58:49,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:49,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2022-12-13 13:58:49,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:49,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2022-12-13 13:58:49,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 13:58:49,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2022-12-13 13:58:49,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:49,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2022-12-13 13:58:49,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-12-13 13:58:49,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-12-13 13:58:49,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2022-12-13 13:58:49,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:49,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-12-13 13:58:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2022-12-13 13:58:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-13 13:58:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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 13:58:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-12-13 13:58:49,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-12-13 13:58:49,423 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-12-13 13:58:49,423 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 13:58:49,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-12-13 13:58:49,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:49,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:49,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:49,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:49,424 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:49,424 INFO L748 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 251#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; 252#L367 assume !(main_~length~0#1 < 1); 241#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; 242#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 243#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); 253#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 255#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 254#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 244#L370-4 main_~j~0#1 := 0; 245#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); 246#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 247#L378-2 [2022-12-13 13:58:49,424 INFO L750 eck$LassoCheckResult]: Loop: 247#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); 256#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 247#L378-2 [2022-12-13 13:58:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2022-12-13 13:58:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:49,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576928504] [2022-12-13 13:58:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:49,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 13:58:49,755 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 13:58:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:49,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576928504] [2022-12-13 13:58:49,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576928504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:49,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963421439] [2022-12-13 13:58:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:49,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:49,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:49,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:49,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:58:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:49,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 13:58:49,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:49,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:58:49,874 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 11 [2022-12-13 13:58:49,882 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 13:58:49,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:49,954 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 33 treesize of output 29 [2022-12-13 13:58:49,958 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 13:58:49,971 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 13:58:49,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963421439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:49,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:49,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-12-13 13:58:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216476957] [2022-12-13 13:58:49,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:49,972 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2022-12-13 13:58:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166633924] [2022-12-13 13:58:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:49,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:49,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:58:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:58:50,026 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 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 13:58:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:50,141 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2022-12-13 13:58:50,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2022-12-13 13:58:50,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 13:58:50,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 40 transitions. [2022-12-13 13:58:50,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-12-13 13:58:50,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-12-13 13:58:50,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2022-12-13 13:58:50,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:50,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-12-13 13:58:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2022-12-13 13:58:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-12-13 13:58:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 13:58:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-12-13 13:58:50,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-12-13 13:58:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:58:50,145 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-12-13 13:58:50,145 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 13:58:50,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-12-13 13:58:50,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:50,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:50,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:50,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:50,146 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:50,146 INFO L748 eck$LassoCheckResult]: Stem: 386#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#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; 388#L367 assume !(main_~length~0#1 < 1); 377#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; 378#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 379#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); 389#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 392#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 397#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 396#L370-4 main_~j~0#1 := 0; 395#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); 384#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 385#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); 382#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 383#L378-2 [2022-12-13 13:58:50,146 INFO L750 eck$LassoCheckResult]: Loop: 383#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); 393#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 383#L378-2 [2022-12-13 13:58:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 1 times [2022-12-13 13:58:50,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:50,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877409436] [2022-12-13 13:58:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,200 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 13:58:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:50,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877409436] [2022-12-13 13:58:50,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877409436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:50,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551292828] [2022-12-13 13:58:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:50,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:50,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:58:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:58:50,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:50,280 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 13:58:50,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:50,310 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 13:58:50,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551292828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:50,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:50,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 13:58:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892960324] [2022-12-13 13:58:50,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:50,311 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2022-12-13 13:58:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:50,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094994699] [2022-12-13 13:58:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:50,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:50,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:58:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:58:50,363 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 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 13:58:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:50,433 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2022-12-13 13:58:50,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2022-12-13 13:58:50,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 13:58:50,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 57 transitions. [2022-12-13 13:58:50,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-12-13 13:58:50,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-12-13 13:58:50,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2022-12-13 13:58:50,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:50,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-12-13 13:58:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2022-12-13 13:58:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-12-13 13:58:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 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 13:58:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-12-13 13:58:50,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-12-13 13:58:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:58:50,439 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-12-13 13:58:50,439 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 13:58:50,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2022-12-13 13:58:50,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 13:58:50,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:50,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:50,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:50,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:50,441 INFO L748 eck$LassoCheckResult]: Stem: 558#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 559#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; 560#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 549#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; 550#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 582#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); 580#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 576#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 577#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); 575#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);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); 574#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 572#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 553#L370-4 main_~j~0#1 := 0; 554#L378-2 [2022-12-13 13:58:50,441 INFO L750 eck$LassoCheckResult]: Loop: 554#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 !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 554#L378-2 [2022-12-13 13:58:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2022-12-13 13:58:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:50,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710311122] [2022-12-13 13:58:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,473 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 13:58:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:50,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710311122] [2022-12-13 13:58:50,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710311122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:50,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66008282] [2022-12-13 13:58:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:50,476 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:50,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:58:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 13:58:50,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:50,541 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 13:58:50,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:58:50,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66008282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:50,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:58:50,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 13:58:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357285489] [2022-12-13 13:58:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:50,541 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2022-12-13 13:58:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:50,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303766116] [2022-12-13 13:58:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:50,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:50,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:58:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:58:50,582 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. cyclomatic complexity: 20 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 13:58:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:50,597 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-12-13 13:58:50,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-12-13 13:58:50,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:50,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 32 transitions. [2022-12-13 13:58:50,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:50,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:50,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2022-12-13 13:58:50,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:50,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-12-13 13:58:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2022-12-13 13:58:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-13 13:58:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-12-13 13:58:50,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-12-13 13:58:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:58:50,600 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-12-13 13:58:50,600 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 13:58:50,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2022-12-13 13:58:50,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:50,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:50,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:50,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:50,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:50,601 INFO L748 eck$LassoCheckResult]: Stem: 671#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 672#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; 673#L367 assume !(main_~length~0#1 < 1); 662#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; 663#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 664#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); 674#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 677#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 675#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); 676#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);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); 684#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 681#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 680#L370-4 main_~j~0#1 := 0; 679#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); 667#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 668#L378-2 [2022-12-13 13:58:50,601 INFO L750 eck$LassoCheckResult]: Loop: 668#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); 678#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 668#L378-2 [2022-12-13 13:58:50,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2022-12-13 13:58:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:50,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079333090] [2022-12-13 13:58:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,913 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 13:58:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:50,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079333090] [2022-12-13 13:58:50,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079333090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646273733] [2022-12-13 13:58:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:50,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:50,915 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:50,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 13:58:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:50,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 13:58:50,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:50,970 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 13:58:51,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:51,023 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 31 treesize of output 26 [2022-12-13 13:58:51,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:51,036 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 31 treesize of output 26 [2022-12-13 13:58:51,071 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 11 [2022-12-13 13:58:51,081 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 13:58:51,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:51,281 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 47 treesize of output 43 [2022-12-13 13:58:51,286 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 146 treesize of output 138 [2022-12-13 13:58:51,345 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 13:58:51,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646273733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:51,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:51,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 13:58:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425644525] [2022-12-13 13:58:51,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:51,346 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2022-12-13 13:58:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639986702] [2022-12-13 13:58:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:51,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:51,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:58:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:58:51,389 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. cyclomatic complexity: 12 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 13:58:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:51,532 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-12-13 13:58:51,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-12-13 13:58:51,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:51,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 32 transitions. [2022-12-13 13:58:51,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:51,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:51,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-12-13 13:58:51,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:51,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-12-13 13:58:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-12-13 13:58:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-12-13 13:58:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-12-13 13:58:51,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-12-13 13:58:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:58:51,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-12-13 13:58:51,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 13:58:51,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-12-13 13:58:51,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:51,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:51,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:51,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:51,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:51,538 INFO L748 eck$LassoCheckResult]: Stem: 831#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 832#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; 833#L367 assume !(main_~length~0#1 < 1); 822#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; 823#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 824#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); 834#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 838#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 835#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); 836#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 837#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 840#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 825#L370-4 main_~j~0#1 := 0; 826#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); 829#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 830#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); 827#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 828#L378-2 [2022-12-13 13:58:51,538 INFO L750 eck$LassoCheckResult]: Loop: 828#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); 839#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 828#L378-2 [2022-12-13 13:58:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 2 times [2022-12-13 13:58:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35235332] [2022-12-13 13:58:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:51,765 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 13:58:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35235332] [2022-12-13 13:58:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35235332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3181907] [2022-12-13 13:58:51,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:58:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:51,767 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:51,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 13:58:51,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:58:51,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:51,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:58:51,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:51,862 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 13:58:51,963 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 17 treesize of output 9 [2022-12-13 13:58:51,974 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 13:58:51,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:52,041 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 37 treesize of output 33 [2022-12-13 13:58:52,043 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 28 treesize of output 20 [2022-12-13 13:58:52,055 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 13:58:52,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3181907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:52,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:52,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 13:58:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779740032] [2022-12-13 13:58:52,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:52,056 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2022-12-13 13:58:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:52,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965278509] [2022-12-13 13:58:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:52,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:52,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:58:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:58:52,105 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 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 13:58:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:52,266 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-12-13 13:58:52,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2022-12-13 13:58:52,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 13:58:52,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 44 transitions. [2022-12-13 13:58:52,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-12-13 13:58:52,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-12-13 13:58:52,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2022-12-13 13:58:52,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:52,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-12-13 13:58:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2022-12-13 13:58:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-12-13 13:58:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-12-13 13:58:52,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-12-13 13:58:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:58:52,270 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-12-13 13:58:52,271 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 13:58:52,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-12-13 13:58:52,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:52,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:52,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:52,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:52,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:52,272 INFO L748 eck$LassoCheckResult]: Stem: 1012#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1013#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; 1011#L367 assume !(main_~length~0#1 < 1); 1002#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; 1003#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1004#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); 1014#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1022#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1015#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); 1016#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1017#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1019#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1020#L370-4 main_~j~0#1 := 0; 1025#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); 1024#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1018#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); 1009#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1010#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); 1007#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1008#L378-2 [2022-12-13 13:58:52,272 INFO L750 eck$LassoCheckResult]: Loop: 1008#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); 1023#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1008#L378-2 [2022-12-13 13:58:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2110686111, now seen corresponding path program 3 times [2022-12-13 13:58:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:52,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605643963] [2022-12-13 13:58:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:52,359 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 13:58:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605643963] [2022-12-13 13:58:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605643963] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:52,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396169669] [2022-12-13 13:58:52,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:58:52,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:52,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:52,361 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:52,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 13:58:52,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:58:52,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:58:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:52,455 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 13:58:52,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:52,495 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 13:58:52,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396169669] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:52,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:52,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 13:58:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864135582] [2022-12-13 13:58:52,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:52,496 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2022-12-13 13:58:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:52,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928273293] [2022-12-13 13:58:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:52,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:52,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:58:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:58:52,540 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 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 13:58:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:52,602 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-12-13 13:58:52,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2022-12-13 13:58:52,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:52,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 41 transitions. [2022-12-13 13:58:52,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:52,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:52,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-12-13 13:58:52,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:52,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-12-13 13:58:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-12-13 13:58:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-12-13 13:58:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 13:58:52,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 13:58:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:58:52,606 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 13:58:52,606 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 13:58:52,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-12-13 13:58:52,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:52,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:52,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:52,607 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:52,607 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:52,607 INFO L748 eck$LassoCheckResult]: Stem: 1209#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1210#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; 1211#L367 assume !(main_~length~0#1 < 1); 1200#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; 1201#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1202#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); 1212#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1215#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1213#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); 1214#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1228#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1227#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); 1222#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);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); 1226#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1223#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1203#L370-4 main_~j~0#1 := 0; 1204#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); 1207#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1208#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); 1205#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1206#L378-2 [2022-12-13 13:58:52,608 INFO L750 eck$LassoCheckResult]: Loop: 1206#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); 1217#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1206#L378-2 [2022-12-13 13:58:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -761055450, now seen corresponding path program 1 times [2022-12-13 13:58:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:52,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601946450] [2022-12-13 13:58:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:52,900 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 13:58:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601946450] [2022-12-13 13:58:52,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601946450] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277681316] [2022-12-13 13:58:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:52,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:52,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:52,901 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:52,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:58:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:52,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:58:52,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:52,990 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 13:58:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:53,057 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 27 treesize of output 26 [2022-12-13 13:58:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:53,068 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 27 treesize of output 26 [2022-12-13 13:58:53,150 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 17 treesize of output 9 [2022-12-13 13:58:53,161 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 13:58:53,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:53,299 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 37 treesize of output 33 [2022-12-13 13:58:53,301 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 28 treesize of output 20 [2022-12-13 13:58:53,313 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 13:58:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277681316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:53,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:53,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2022-12-13 13:58:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053532230] [2022-12-13 13:58:53,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:53,314 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:53,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2022-12-13 13:58:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:53,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393434950] [2022-12-13 13:58:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:53,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:53,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 13:58:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-12-13 13:58:53,361 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 12 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 13:58:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:53,536 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-12-13 13:58:53,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2022-12-13 13:58:53,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:53,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2022-12-13 13:58:53,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:53,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:53,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2022-12-13 13:58:53,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:53,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-12-13 13:58:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2022-12-13 13:58:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-12-13 13:58:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-12-13 13:58:53,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-12-13 13:58:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:58:53,540 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-12-13 13:58:53,540 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 13:58:53,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2022-12-13 13:58:53,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:53,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:53,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:53,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:53,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:53,541 INFO L748 eck$LassoCheckResult]: Stem: 1417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1418#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; 1419#L367 assume !(main_~length~0#1 < 1); 1408#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; 1409#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1410#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); 1420#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1423#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1421#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); 1422#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1431#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1430#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); 1428#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1429#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1427#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1411#L370-4 main_~j~0#1 := 0; 1412#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); 1415#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1416#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); 1424#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1425#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); 1413#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1414#L378-2 [2022-12-13 13:58:53,541 INFO L750 eck$LassoCheckResult]: Loop: 1414#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); 1426#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1414#L378-2 [2022-12-13 13:58:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1622874713, now seen corresponding path program 4 times [2022-12-13 13:58:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700023552] [2022-12-13 13:58:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:53,798 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 13:58:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700023552] [2022-12-13 13:58:53,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700023552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12238740] [2022-12-13 13:58:53,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:58:53,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:53,800 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:53,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 13:58:53,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:58:53,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:53,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:58:53,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:53,870 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 13:58:53,968 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 29 treesize of output 11 [2022-12-13 13:58:53,970 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 13:58:53,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:54,048 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 37 treesize of output 33 [2022-12-13 13:58:54,052 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 28 treesize of output 20 [2022-12-13 13:58:54,070 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 13:58:54,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12238740] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:54,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:54,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-12-13 13:58:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050827527] [2022-12-13 13:58:54,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:54,070 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2022-12-13 13:58:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:54,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640591586] [2022-12-13 13:58:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:54,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:54,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:58:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:58:54,116 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 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 13:58:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:54,289 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-12-13 13:58:54,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2022-12-13 13:58:54,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-12-13 13:58:54,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 52 transitions. [2022-12-13 13:58:54,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-12-13 13:58:54,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-12-13 13:58:54,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2022-12-13 13:58:54,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:54,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-12-13 13:58:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2022-12-13 13:58:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-12-13 13:58:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-12-13 13:58:54,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-12-13 13:58:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:58:54,293 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-12-13 13:58:54,293 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 13:58:54,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2022-12-13 13:58:54,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:54,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:54,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:54,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:54,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:54,294 INFO L748 eck$LassoCheckResult]: Stem: 1633#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1634#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; 1635#L367 assume !(main_~length~0#1 < 1); 1624#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; 1625#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1626#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); 1636#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1646#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1647#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); 1648#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1649#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1637#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); 1638#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1641#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1642#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1631#L370-4 main_~j~0#1 := 0; 1632#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); 1653#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1652#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); 1629#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1630#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); 1640#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1651#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); 1627#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1628#L378-2 [2022-12-13 13:58:54,294 INFO L750 eck$LassoCheckResult]: Loop: 1628#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); 1650#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1628#L378-2 [2022-12-13 13:58:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -509471318, now seen corresponding path program 5 times [2022-12-13 13:58:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:54,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208118977] [2022-12-13 13:58:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:54,377 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 13:58:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:54,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208118977] [2022-12-13 13:58:54,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208118977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:54,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770933428] [2022-12-13 13:58:54,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:58:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:54,379 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:54,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 13:58:54,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 13:58:54,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:54,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:58:54,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:54,502 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 13:58:54,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770933428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:54,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:54,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 13:58:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653428346] [2022-12-13 13:58:54,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:54,556 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2022-12-13 13:58:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:54,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947645759] [2022-12-13 13:58:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:54,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:54,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:58:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:58:54,600 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:54,674 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-12-13 13:58:54,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2022-12-13 13:58:54,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:54,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 47 transitions. [2022-12-13 13:58:54,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:54,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:54,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2022-12-13 13:58:54,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:54,675 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-12-13 13:58:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2022-12-13 13:58:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-12-13 13:58:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-12-13 13:58:54,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-12-13 13:58:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:58:54,678 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-12-13 13:58:54,678 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 13:58:54,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-12-13 13:58:54,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:54,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:54,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:54,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:54,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:54,679 INFO L748 eck$LassoCheckResult]: Stem: 1878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1879#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; 1880#L367 assume !(main_~length~0#1 < 1); 1869#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; 1870#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1871#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); 1881#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1902#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1882#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); 1883#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1885#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1886#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); 1901#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 1900#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1899#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); 1888#L372 assume 0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2);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); 1898#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1895#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1894#L370-4 main_~j~0#1 := 0; 1893#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 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1892#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); 1890#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1889#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 !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 1873#L378-2 [2022-12-13 13:58:54,680 INFO L750 eck$LassoCheckResult]: Loop: 1873#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); 1891#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 1873#L378-2 [2022-12-13 13:58:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1285147747, now seen corresponding path program 2 times [2022-12-13 13:58:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:54,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768643623] [2022-12-13 13:58:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:54,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:55,034 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 13:58:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768643623] [2022-12-13 13:58:55,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768643623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48777921] [2022-12-13 13:58:55,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:58:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:55,035 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:55,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 13:58:55,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:58:55,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:55,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:58:55,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:55,160 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 13:58:55,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:55,221 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 27 treesize of output 26 [2022-12-13 13:58:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:58:55,232 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 27 treesize of output 26 [2022-12-13 13:58:55,315 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 17 treesize of output 9 [2022-12-13 13:58:55,324 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 13:58:55,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:55,449 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 37 treesize of output 33 [2022-12-13 13:58:55,451 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 28 treesize of output 20 [2022-12-13 13:58:55,467 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 13:58:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48777921] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:55,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 26 [2022-12-13 13:58:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344909334] [2022-12-13 13:58:55,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:55,468 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2022-12-13 13:58:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:55,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129324940] [2022-12-13 13:58:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:55,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:55,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:58:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2022-12-13 13:58:55,505 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 13 Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:55,720 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-12-13 13:58:55,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2022-12-13 13:58:55,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:55,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 48 transitions. [2022-12-13 13:58:55,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 13:58:55,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 13:58:55,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2022-12-13 13:58:55,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 13:58:55,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-12-13 13:58:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2022-12-13 13:58:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-12-13 13:58:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-12-13 13:58:55,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-12-13 13:58:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:58:55,725 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-12-13 13:58:55,725 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 13:58:55,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-12-13 13:58:55,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-12-13 13:58:55,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 13:58:55,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 13:58:55,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:55,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 13:58:55,727 INFO L748 eck$LassoCheckResult]: Stem: 2134#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2135#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; 2136#L367 assume !(main_~length~0#1 < 1); 2125#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; 2126#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2127#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); 2137#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2141#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2138#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); 2139#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2153#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2152#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); 2151#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2150#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2149#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); 2143#L372 assume !(0 != (if main_#t~mem209#1 < 0 && 0 != main_#t~mem209#1 % 2 then main_#t~mem209#1 % 2 - 2 else main_#t~mem209#1 % 2));havoc main_#t~mem209#1; 2147#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2142#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2132#L370-4 main_~j~0#1 := 0; 2133#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); 2130#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2131#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); 2140#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2148#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); 2145#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2144#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); 2128#L378 assume !(0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2));havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := main_#t~post212#1 - 1;havoc main_#t~post212#1; 2129#L378-2 [2022-12-13 13:58:55,727 INFO L750 eck$LassoCheckResult]: Loop: 2129#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); 2146#L378 assume 0 == (if main_#t~mem210#1 < 0 && 0 != main_#t~mem210#1 % 2 then main_#t~mem210#1 % 2 - 2 else main_#t~mem210#1 % 2);havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post211#1;havoc main_#t~post211#1; 2129#L378-2 [2022-12-13 13:58:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1665431516, now seen corresponding path program 6 times [2022-12-13 13:58:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266776773] [2022-12-13 13:58:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:56,054 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 13:58:56,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:56,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266776773] [2022-12-13 13:58:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266776773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:58:56,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467392682] [2022-12-13 13:58:56,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:58:56,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:58:56,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:58:56,056 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:58:56,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 13:58:56,115 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 13:58:56,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:58:56,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 13:58:56,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:58:56,169 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 13:58:56,447 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 13:58:56,447 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 25 treesize of output 12 [2022-12-13 13:58:56,460 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 13:58:56,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:58:56,839 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 41 treesize of output 37 [2022-12-13 13:58:56,842 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 36 treesize of output 24 [2022-12-13 13:58:56,899 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 13:58:56,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467392682] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:58:56,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:58:56,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2022-12-13 13:58:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126020577] [2022-12-13 13:58:56,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:58:56,900 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 13:58:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2022-12-13 13:58:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:56,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018397968] [2022-12-13 13:58:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:56,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:58:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:58:56,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:58:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 13:58:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 13:58:56,941 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 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 13:58:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:58:58,392 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-12-13 13:58:58,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2022-12-13 13:58:58,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 13:58:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2022-12-13 13:58:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 13:58:58,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 13:58:58,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 13:58:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:58:58,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:58:58,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:58:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:58:58,393 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:58:58,393 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 13:58:58,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:58:58,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 13:58:58,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 13:58:58,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 01:58:58 BoogieIcfgContainer [2022-12-13 13:58:58,398 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 13:58:58,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:58:58,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:58:58,399 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:58:58,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:58:46" (3/4) ... [2022-12-13 13:58:58,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 13:58:58,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:58:58,401 INFO L158 Benchmark]: Toolchain (without parser) took 12091.45ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 93.6MB in the beginning and 119.7MB in the end (delta: -26.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 13:58:58,401 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:58:58,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.85ms. Allocated memory is still 127.9MB. Free memory was 93.6MB in the beginning and 76.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 13:58:58,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 127.9MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:58:58,402 INFO L158 Benchmark]: Boogie Preprocessor took 21.31ms. Allocated memory is still 127.9MB. Free memory was 74.2MB in the beginning and 73.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:58:58,402 INFO L158 Benchmark]: RCFGBuilder took 250.18ms. Allocated memory is still 127.9MB. Free memory was 73.1MB in the beginning and 62.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:58:58,402 INFO L158 Benchmark]: BuchiAutomizer took 11459.44ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 62.1MB in the beginning and 119.7MB in the end (delta: -57.6MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-12-13 13:58:58,402 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 186.6MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:58:58,403 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.13ms. Allocated memory is still 127.9MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.85ms. Allocated memory is still 127.9MB. Free memory was 93.6MB in the beginning and 76.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 127.9MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.31ms. Allocated memory is still 127.9MB. Free memory was 74.2MB in the beginning and 73.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.18ms. Allocated memory is still 127.9MB. Free memory was 73.1MB in the beginning and 62.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 11459.44ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 62.1MB in the beginning and 119.7MB in the end (delta: -57.6MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 186.6MB. Free memory is still 119.7MB. 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 14 terminating modules (12 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 -1 * j + length and consists of 3 locations. 12 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 8.3s. Construction of modules took 1.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 10 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, 434 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 585 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1743 IncrementalHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 128 mSDtfsCounter, 1743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU12 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf100 lsp92 ukn84 mio100 lsp60 div164 bol100 ite100 ukn100 eq155 hnf93 smp75 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms 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 13:58:58,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 13:58:58,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 13:58:58,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:59,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 13:58:59,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 13:58:59,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 13:58:59,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 13:58:59,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 13:59:00,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 13:59:00,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 13:59:00,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 13:59:00,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_915af85b-c2f1-44b8-a289-eccf7f5c9c9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE