./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/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_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/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_a36844c1-28fb-496c-b06e-0944a1fb8772/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 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 --- 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 12:05:02,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:05:02,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:05:02,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:05:02,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:05:02,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:05:02,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:05:02,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:05:02,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:05:02,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:05:02,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:05:02,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:05:02,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:05:02,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:05:02,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:05:02,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:05:02,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:05:02,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:05:02,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:05:02,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:05:02,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:05:02,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:05:02,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:05:02,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:05:02,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:05:02,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:05:02,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:05:02,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:05:02,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:05:02,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:05:02,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:05:02,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:05:02,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:05:02,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:05:02,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:05:02,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:05:02,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:05:02,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:05:02,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:05:02,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:05:02,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:05:02,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 12:05:02,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:05:02,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:05:02,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:05:02,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:05:02,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:05:02,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:05:02,230 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:05:02,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 12:05:02,230 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 12:05:02,230 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 12:05:02,230 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 12:05:02,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 12:05:02,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 12:05:02,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:05:02,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:05:02,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:05:02,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 12:05:02,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:05:02,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:05:02,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:05:02,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:05:02,234 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 12:05:02,234 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_a36844c1-28fb-496c-b06e-0944a1fb8772/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_a36844c1-28fb-496c-b06e-0944a1fb8772/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 -> 1e35e1f5dba77fd8ed843a6cdfa0fc21590233839dbc71bb991dc25008dd4b76 [2022-12-13 12:05:02,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:05:02,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:05:02,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:05:02,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:05:02,442 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:05:02,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-12-13 12:05:05,065 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:05:05,242 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:05:05,243 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-12-13 12:05:05,253 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/data/b287cc1ad/a41497223f104f34929ceae74b5d3a1f/FLAG064a0f513 [2022-12-13 12:05:05,263 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/data/b287cc1ad/a41497223f104f34929ceae74b5d3a1f [2022-12-13 12:05:05,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:05:05,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:05:05,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:05,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:05:05,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:05:05,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a2f3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05, skipping insertion in model container [2022-12-13 12:05:05,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:05:05,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:05:05,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:05,489 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:05:05,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:05,526 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:05:05,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05 WrapperNode [2022-12-13 12:05:05,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:05,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:05,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:05:05,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:05:05,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,554 INFO L138 Inliner]: procedures = 110, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-12-13 12:05:05,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:05,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:05:05,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:05:05,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:05:05,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,569 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:05:05,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:05:05,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:05:05,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:05:05,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (1/1) ... [2022-12-13 12:05:05,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:05,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:05,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 12:05:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:05:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:05:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:05:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:05:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:05:05,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:05:05,705 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:05:05,706 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:05:05,790 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:05:05,795 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:05:05,795 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 12:05:05,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:05 BoogieIcfgContainer [2022-12-13 12:05:05,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:05:05,798 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 12:05:05,798 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 12:05:05,801 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 12:05:05,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:05:05,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 12:05:05" (1/3) ... [2022-12-13 12:05:05,802 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27c59ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 12:05:05, skipping insertion in model container [2022-12-13 12:05:05,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:05:05,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:05" (2/3) ... [2022-12-13 12:05:05,803 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27c59ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 12:05:05, skipping insertion in model container [2022-12-13 12:05:05,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 12:05:05,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:05" (3/3) ... [2022-12-13 12:05:05,804 INFO L332 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i [2022-12-13 12:05:05,843 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 12:05:05,843 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 12:05:05,843 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 12:05:05,843 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 12:05:05,843 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 12:05:05,843 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 12:05:05,844 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 12:05:05,844 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 12:05:05,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:05,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:05,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:05,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:05,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 12:05:05,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 12:05:05,864 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 12:05:05,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:05,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:05,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:05,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:05,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 12:05:05,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 12:05:05,871 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 7#L554-3true [2022-12-13 12:05:05,872 INFO L750 eck$LassoCheckResult]: Loop: 7#L554-3true call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9#L554-1true assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5#L556-3true assume !true; 2#L556-4true call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 7#L554-3true [2022-12-13 12:05:05,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 12:05:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:05,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253328047] [2022-12-13 12:05:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-12-13 12:05:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585822054] [2022-12-13 12:05:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:06,102 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 12:05:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585822054] [2022-12-13 12:05:06,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585822054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:06,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:06,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997126804] [2022-12-13 12:05:06,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:06,108 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:05:06,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:05:06,141 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:06,146 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-12-13 12:05:06,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-12-13 12:05:06,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:06,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-12-13 12:05:06,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-12-13 12:05:06,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-12-13 12:05:06,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-12-13 12:05:06,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:05:06,151 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 12:05:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-12-13 12:05:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-12-13 12:05:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-12-13 12:05:06,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 12:05:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:05:06,172 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-12-13 12:05:06,172 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 12:05:06,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-12-13 12:05:06,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:06,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:06,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:06,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 12:05:06,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 12:05:06,174 INFO L748 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 31#L554-3 [2022-12-13 12:05:06,174 INFO L750 eck$LassoCheckResult]: Loop: 31#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 36#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 32#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 33#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 30#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 31#L554-3 [2022-12-13 12:05:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 12:05:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283244974] [2022-12-13 12:05:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-12-13 12:05:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91638326] [2022-12-13 12:05:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2022-12-13 12:05:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906717030] [2022-12-13 12:05:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:06,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:07,012 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:05:07,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:05:07,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:05:07,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:05:07,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 12:05:07,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:05:07,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:05:07,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration2_Lasso [2022-12-13 12:05:07,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:05:07,014 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:05:07,029 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 12:05:07,036 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 12:05:07,037 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 12:05:07,040 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 12:05:07,041 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 12:05:07,043 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 12:05:07,045 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 12:05:07,046 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 12:05:07,048 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 12:05:07,050 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 12:05:07,475 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 12:05:07,477 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 12:05:07,478 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 12:05:07,480 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 12:05:07,481 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 12:05:07,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:07,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:07,712 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:05:07,716 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 12:05:07,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 12:05:07,721 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 12:05:07,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:07,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:07,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:07,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 12:05:07,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:07,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:07,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:07,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:07,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 12:05:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 12:05:07,764 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 12:05:07,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 12:05:07,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 12:05:07,787 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 12:05:07,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 12:05:07,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 12:05:07,810 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 12:05:07,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 12:05:07,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 12:05:07,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:07,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:07,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:07,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:07,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:07,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,853 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 12:05:07,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:07,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:07,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:07,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:07,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 12:05:07,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,872 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 12:05:07,874 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 12:05:07,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:07,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:07,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:07,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 12:05:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 12:05:07,892 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 12:05:07,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 12:05:07,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 12:05:07,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:07,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 12:05:07,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 12:05:07,942 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 12:05:07,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 12:05:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,966 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 12:05:07,968 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 12:05:07,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:07,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:07,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:07,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:07,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:07,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:07,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:07,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:07,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:07,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:07,992 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:07,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 12:05:07,994 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 12:05:08,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:08,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:08,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:08,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:08,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:08,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:08,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:08,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 12:05:08,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:08,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:08,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 12:05:08,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:08,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:08,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:08,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:08,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:08,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:08,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:08,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 12:05:08,047 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-12-13 12:05:08,048 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-12-13 12:05:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:08,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:08,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 12:05:08,091 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 12:05:08,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 12:05:08,105 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 12:05:08,105 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 Supporting invariants [] [2022-12-13 12:05:08,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:08,197 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-12-13 12:05:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:08,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:05:08,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:08,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 12:05:08,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:08,287 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:08,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-12-13 12:05:08,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:08,394 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 12:05:08,397 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-12-13 12:05:08,398 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:08,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 11 states. [2022-12-13 12:05:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-12-13 12:05:08,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2022-12-13 12:05:08,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:08,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2022-12-13 12:05:08,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:08,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2022-12-13 12:05:08,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:08,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2022-12-13 12:05:08,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:08,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2022-12-13 12:05:08,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-12-13 12:05:08,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-12-13 12:05:08,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-12-13 12:05:08,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:08,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 12:05:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-12-13 12:05:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-13 12:05:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-12-13 12:05:08,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 12:05:08,514 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-12-13 12:05:08,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 12:05:08,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-12-13 12:05:08,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-12-13 12:05:08,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:08,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:08,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:05:08,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 12:05:08,515 INFO L748 eck$LassoCheckResult]: Stem: 215#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 212#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 214#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 208#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 209#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 217#L556-3 [2022-12-13 12:05:08,515 INFO L750 eck$LassoCheckResult]: Loop: 217#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 218#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 217#L556-3 [2022-12-13 12:05:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-12-13 12:05:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:08,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612058782] [2022-12-13 12:05:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-12-13 12:05:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:08,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081060218] [2022-12-13 12:05:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2022-12-13 12:05:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:08,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248306471] [2022-12-13 12:05:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:08,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:09,256 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:05:09,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:05:09,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:05:09,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:05:09,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 12:05:09,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:05:09,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:05:09,257 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration3_Lasso [2022-12-13 12:05:09,257 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:05:09,257 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:05:09,260 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 12:05:09,262 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 12:05:09,264 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 12:05:09,266 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 12:05:09,267 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 12:05:09,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:09,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:09,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:09,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:09,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:09,616 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 12:05:09,619 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 12:05:09,620 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 12:05:09,622 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 12:05:09,624 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 12:05:09,626 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 12:05:09,627 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 12:05:09,894 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:05:09,894 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 12:05:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 12:05:09,898 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 12:05:09,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:09,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:09,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:09,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:09,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:09,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:09,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:09,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:09,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 12:05:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,914 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 12:05:09,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:09,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:09,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:09,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:09,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:09,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:09,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:09,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:09,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:09,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-12-13 12:05:09,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,931 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 12:05:09,933 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 12:05:09,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:09,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:09,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:09,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:09,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:09,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:09,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:09,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:09,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:09,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,950 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 12:05:09,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:09,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:09,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:09,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:09,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:09,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:09,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:09,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:09,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:09,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 12:05:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,968 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 12:05:09,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:09,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:09,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:09,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:09,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:09,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:09,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:09,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:09,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:09,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:09,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:09,987 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:09,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 12:05:09,992 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 12:05:10,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 12:05:10,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,010 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 12:05:10,012 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 12:05:10,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:10,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:10,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:10,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,027 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 12:05:10,030 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 12:05:10,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-12-13 12:05:10,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,048 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 12:05:10,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:10,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:10,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:10,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:10,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-12-13 12:05:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,065 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 12:05:10,067 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 12:05:10,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-12-13 12:05:10,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,086 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 12:05:10,088 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 12:05:10,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-12-13 12:05:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,107 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 12:05:10,109 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 12:05:10,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-12-13 12:05:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,139 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 12:05:10,141 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 12:05:10,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,160 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 12:05:10,162 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 12:05:10,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,181 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 12:05:10,183 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 12:05:10,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 12:05:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,208 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 12:05:10,210 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 12:05:10,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:10,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-12-13 12:05:10,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,231 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 12:05:10,233 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 12:05:10,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:10,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:10,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:10,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:10,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:10,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:10,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 12:05:10,262 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 12:05:10,262 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-12-13 12:05:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:10,263 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:10,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 12:05:10,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 12:05:10,277 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-12-13 12:05:10,278 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 12:05:10,278 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0#1.base) ULTIMATE.start_main_~j~0#1.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 + 1 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_2 >= 0] [2022-12-13 12:05:10,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-12-13 12:05:10,353 INFO L156 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2022-12-13 12:05:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:10,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 12:05:10,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:10,505 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 12:05:10,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-12-13 12:05:10,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 12:05:10,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-13 12:05:10,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-13 12:05:10,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-12-13 12:05:10,986 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-12-13 12:05:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 152 [2022-12-13 12:05:11,068 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 9 treesize of output 7 [2022-12-13 12:05:11,086 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 12:05:11,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-12-13 12:05:11,089 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 9 treesize of output 7 [2022-12-13 12:05:11,096 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:11,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-12-13 12:05:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:11,307 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-12-13 12:05:11,318 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 9 treesize of output 7 [2022-12-13 12:05:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:11,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:05:11,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:11,399 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 12:05:11,400 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-12-13 12:05:11,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:11,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 4 states. [2022-12-13 12:05:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-12-13 12:05:11,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2022-12-13 12:05:11,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:11,443 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:11,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 12:05:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:11,500 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:11,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-12-13 12:05:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:11,531 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 12:05:11,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 94 [2022-12-13 12:05:11,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 12:05:11,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-13 12:05:11,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 22 [2022-12-13 12:05:11,569 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 9 treesize of output 7 [2022-12-13 12:05:11,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:11,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:11,680 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:11,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2022-12-13 12:05:11,690 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 9 treesize of output 7 [2022-12-13 12:05:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:11,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:05:11,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:11,760 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 12:05:11,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2022-12-13 12:05:11,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:11,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 3 states. [2022-12-13 12:05:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2022-12-13 12:05:11,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2022-12-13 12:05:11,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:11,816 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:11,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 12:05:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:11,934 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 12:05:11,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-12-13 12:05:11,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 12:05:11,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-13 12:05:11,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-13 12:05:12,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,250 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 12:05:12,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 66 [2022-12-13 12:05:12,260 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 9 treesize of output 7 [2022-12-13 12:05:12,262 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 9 treesize of output 7 [2022-12-13 12:05:12,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:05:12,298 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 12:05:12,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 386 treesize of output 360 [2022-12-13 12:05:12,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 12:05:12,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 12:05:12,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 12:05:12,398 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 9 treesize of output 7 [2022-12-13 12:05:12,411 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:12,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-12-13 12:05:12,426 WARN L859 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_main_~i~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_15)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|)) (.cse1 (select v_DerPreprocessor_15 |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~i~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_main_~j~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~n~0#1.base| v_DerPreprocessor_21))) (and (= (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) v_DerPreprocessor_13) (= .cse1 (select v_DerPreprocessor_21 |c_ULTIMATE.start_main_~n~0#1.offset|)) (= (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|) .cse2) (= (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) .cse1) (= v_DerPreprocessor_19 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))))) (= |c_ULTIMATE.start_main_~j~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~j~0#1.base|) c_unseeded (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~i~0#1.base|))) is different from true [2022-12-13 12:05:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,516 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:12,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2022-12-13 12:05:12,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 12:05:12,530 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 9 treesize of output 7 [2022-12-13 12:05:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:12,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:05:12,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:12,593 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 12:05:12,594 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-12-13 12:05:12,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:12,635 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 2 states. [2022-12-13 12:05:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2022-12-13 12:05:12,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2022-12-13 12:05:12,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:12,636 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:12,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 12:05:12,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:12,699 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:05:12,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2022-12-13 12:05:12,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:05:12,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-13 12:05:12,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-13 12:05:12,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 12:05:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:12,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:05:12,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:12,826 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 12:05:12,826 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2022-12-13 12:05:12,826 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:12,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 27 transitions. Complement of second has 9 states. [2022-12-13 12:05:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-12-13 12:05:12,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2022-12-13 12:05:12,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:12,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-12-13 12:05:12,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:12,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 6 letters. Loop has 4 letters. [2022-12-13 12:05:12,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:12,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2022-12-13 12:05:12,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-12-13 12:05:12,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2022-12-13 12:05:12,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 12:05:12,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 12:05:12,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2022-12-13 12:05:12,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:12,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-12-13 12:05:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2022-12-13 12:05:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-12-13 12:05:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-12-13 12:05:12,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-12-13 12:05:12,884 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-12-13 12:05:12,885 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 12:05:12,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-12-13 12:05:12,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-12-13 12:05:12,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:12,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:12,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:05:12,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-12-13 12:05:12,886 INFO L748 eck$LassoCheckResult]: Stem: 546#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 549#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 545#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 538#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 539#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 551#L556-3 [2022-12-13 12:05:12,886 INFO L750 eck$LassoCheckResult]: Loop: 551#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 542#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 534#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 535#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 543#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 553#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 552#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 551#L556-3 [2022-12-13 12:05:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 3 times [2022-12-13 12:05:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:12,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874948475] [2022-12-13 12:05:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:12,923 INFO L85 PathProgramCache]: Analyzing trace with hash 247318912, now seen corresponding path program 1 times [2022-12-13 12:05:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:12,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671803177] [2022-12-13 12:05:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:12,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 1 times [2022-12-13 12:05:12,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:12,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016372155] [2022-12-13 12:05:12,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:12,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:12,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:14,041 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:05:14,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:05:14,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:05:14,041 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:05:14,041 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 12:05:14,041 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,041 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:05:14,041 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:05:14,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration4_Lasso [2022-12-13 12:05:14,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:05:14,042 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:05:14,044 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 12:05:14,047 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 12:05:14,048 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 12:05:14,049 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 12:05:14,051 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 12:05:14,052 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 12:05:14,054 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 12:05:14,055 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 12:05:14,057 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 12:05:14,058 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 12:05:14,523 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 12:05:14,525 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 12:05:14,526 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 12:05:14,528 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 12:05:14,529 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 12:05:14,530 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 12:05:14,858 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:05:14,858 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 12:05:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,859 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 12:05:14,861 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 12:05:14,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:14,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:14,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-12-13 12:05:14,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,879 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 12:05:14,882 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 12:05:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:14,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:14,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:14,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-12-13 12:05:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,897 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-12-13 12:05:14,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 12:05:14,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:14,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:14,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:14,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-12-13 12:05:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,914 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-12-13 12:05:14,917 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 12:05:14,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:14,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:14,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-12-13 12:05:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,934 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-12-13 12:05:14,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 12:05:14,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:14,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:14,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:14,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-12-13 12:05:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,953 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-12-13 12:05:14,955 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 12:05:14,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:14,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:14,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:14,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-12-13 12:05:14,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,971 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-12-13 12:05:14,973 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 12:05:14,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:14,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:14,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:14,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:14,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:14,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:14,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:14,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-12-13 12:05:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:14,990 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:14,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-12-13 12:05:14,992 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 12:05:15,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:15,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:15,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:15,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:15,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:15,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:15,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:15,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:15,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-12-13 12:05:15,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:15,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:15,007 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:15,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-12-13 12:05:15,009 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 12:05:15,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:15,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:15,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:15,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:15,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:15,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:15,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:15,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:15,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:15,024 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:15,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-12-13 12:05:15,026 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 12:05:15,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:15,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:15,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:15,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:15,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:15,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:15,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:15,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-12-13 12:05:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:15,047 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:15,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-12-13 12:05:15,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:15,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:15,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:15,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:15,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:15,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:15,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:15,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:15,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:15,088 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:15,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-12-13 12:05:15,090 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 12:05:15,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:15,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:15,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:15,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:15,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:15,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:15,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 12:05:15,126 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 12:05:15,126 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-12-13 12:05:15,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:15,127 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:15,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-12-13 12:05:15,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 12:05:15,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 12:05:15,140 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 12:05:15,140 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_3 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0#1.base) ULTIMATE.start_main_~n~0#1.offset)_3 Supporting invariants [] [2022-12-13 12:05:15,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:15,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:15,239 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-12-13 12:05:15,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:15,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 12:05:15,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:15,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 12:05:15,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:15,329 INFO L321 Elim1Store]: treesize reduction 55, result has 44.4 percent of original size [2022-12-13 12:05:15,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 66 [2022-12-13 12:05:15,467 INFO L321 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2022-12-13 12:05:15,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 73 [2022-12-13 12:05:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:15,570 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-12-13 12:05:15,570 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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 12:05:15,651 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 7. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 48 transitions. Complement of second has 15 states. [2022-12-13 12:05:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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 12:05:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-12-13 12:05:15,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 6 letters. Loop has 7 letters. [2022-12-13 12:05:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:15,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 13 letters. Loop has 7 letters. [2022-12-13 12:05:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:15,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 6 letters. Loop has 14 letters. [2022-12-13 12:05:15,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:15,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2022-12-13 12:05:15,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-12-13 12:05:15,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 45 transitions. [2022-12-13 12:05:15,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-12-13 12:05:15,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-12-13 12:05:15,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2022-12-13 12:05:15,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:15,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-12-13 12:05:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2022-12-13 12:05:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-12-13 12:05:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 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 12:05:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-12-13 12:05:15,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-12-13 12:05:15,659 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-12-13 12:05:15,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 12:05:15,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2022-12-13 12:05:15,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-12-13 12:05:15,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:15,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:15,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2022-12-13 12:05:15,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-12-13 12:05:15,661 INFO L748 eck$LassoCheckResult]: Stem: 775#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 776#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 782#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 786#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 792#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 791#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 787#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 774#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 773#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 772#L556-1 [2022-12-13 12:05:15,662 INFO L750 eck$LassoCheckResult]: Loop: 772#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 780#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 799#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 798#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 797#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 796#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 795#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 772#L556-1 [2022-12-13 12:05:15,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 4 times [2022-12-13 12:05:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:15,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634192522] [2022-12-13 12:05:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1230755424, now seen corresponding path program 2 times [2022-12-13 12:05:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:15,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061756604] [2022-12-13 12:05:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 2 times [2022-12-13 12:05:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:15,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960288756] [2022-12-13 12:05:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:15,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:17,384 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 12:05:17,384 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 12:05:17,384 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 12:05:17,384 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 12:05:17,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 12:05:17,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:17,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 12:05:17,385 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 12:05:17,385 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca-2.i_Iteration5_Lasso [2022-12-13 12:05:17,385 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 12:05:17,385 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 12:05:17,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:17,390 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 12:05:17,391 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 12:05:17,392 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 12:05:17,393 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:17,394 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 12:05:17,395 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 12:05:17,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:17,397 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 12:05:17,398 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:17,765 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 12:05:17,766 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 12:05:17,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:17,769 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 12:05:17,770 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 12:05:18,007 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 12:05:18,008 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 12:05:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,009 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-12-13 12:05:18,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:18,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-12-13 12:05:18,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,026 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-12-13 12:05:18,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 12:05:18,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-12-13 12:05:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,044 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-12-13 12:05:18,046 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 12:05:18,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,065 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-12-13 12:05:18,067 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 12:05:18,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-12-13 12:05:18,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,083 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-12-13 12:05:18,085 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 12:05:18,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-12-13 12:05:18,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,100 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-12-13 12:05:18,102 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 12:05:18,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-12-13 12:05:18,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,118 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-12-13 12:05:18,121 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 12:05:18,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 12:05:18,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 12:05:18,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 12:05:18,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:18,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,137 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-12-13 12:05:18,139 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 12:05:18,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-12-13 12:05:18,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,157 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-12-13 12:05:18,159 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 12:05:18,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-12-13 12:05:18,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,177 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-12-13 12:05:18,179 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 12:05:18,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-12-13 12:05:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,211 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-12-13 12:05:18,213 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 12:05:18,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-12-13 12:05:18,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,234 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-12-13 12:05:18,237 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 12:05:18,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-12-13 12:05:18,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,255 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-12-13 12:05:18,257 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 12:05:18,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-12-13 12:05:18,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,275 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-12-13 12:05:18,277 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 12:05:18,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 12:05:18,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-12-13 12:05:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,303 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-12-13 12:05:18,305 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 12:05:18,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 12:05:18,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 12:05:18,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 12:05:18,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 12:05:18,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 12:05:18,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 12:05:18,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 12:05:18,355 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-12-13 12:05:18,355 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 12:05:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 12:05:18,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:18,356 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 12:05:18,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-12-13 12:05:18,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 12:05:18,370 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-12-13 12:05:18,370 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 12:05:18,370 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~mem11#1) = 1*ULTIMATE.start_main_#t~mem10#1 - 1*ULTIMATE.start_main_#t~mem11#1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_4 >= 0] [2022-12-13 12:05:18,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-12-13 12:05:18,455 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2022-12-13 12:05:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:18,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:05:18,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:18,514 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 12:05:18,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:18,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-12-13 12:05:18,610 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:18,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 12:05:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:18,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:05:18,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:18,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:18,718 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:18,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 12:05:18,803 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:05:18,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-12-13 12:05:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:18,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 6 loop predicates [2022-12-13 12:05:18,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:18,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 51 transitions. Complement of second has 5 states. [2022-12-13 12:05:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-12-13 12:05:18,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 9 letters. Loop has 7 letters. [2022-12-13 12:05:18,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:18,877 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:18,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:05:18,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:18,942 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 12:05:18,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:19,036 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:19,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 12:05:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:19,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:05:19,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:19,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:19,163 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:19,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 12:05:19,260 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:05:19,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-12-13 12:05:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:19,299 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 6 loop predicates [2022-12-13 12:05:19,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:19,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 51 transitions. Complement of second has 5 states. [2022-12-13 12:05:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 12:05:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2022-12-13 12:05:19,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 9 letters. Loop has 7 letters. [2022-12-13 12:05:19,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:19,334 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:19,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:19,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:05:19,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:19,394 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 12:05:19,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:19,485 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:19,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 12:05:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:19,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 12:05:19,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:19,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:19,605 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:19,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 12:05:19,697 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:05:19,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2022-12-13 12:05:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:19,736 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 6 loop predicates [2022-12-13 12:05:19,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:19,921 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 67 transitions. Complement of second has 19 states. [2022-12-13 12:05:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 7 stem states 3 non-accepting loop states 2 accepting loop states [2022-12-13 12:05:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-12-13 12:05:19,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 9 letters. Loop has 7 letters. [2022-12-13 12:05:19,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:19,922 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:19,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:05:19,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:19,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 11 treesize of output 7 [2022-12-13 12:05:19,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:20,047 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:20,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 12:05:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:20,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 12:05:20,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:20,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:20,141 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:20,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 12:05:20,197 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:05:20,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-12-13 12:05:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:20,244 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates [2022-12-13 12:05:20,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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 12:05:20,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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) Result 56 states and 67 transitions. Complement of second has 19 states. [2022-12-13 12:05:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 7 stem states 3 non-accepting loop states 2 accepting loop states [2022-12-13 12:05:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) 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 12:05:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-12-13 12:05:20,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 9 letters. Loop has 7 letters. [2022-12-13 12:05:20,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:20,514 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 12:05:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:20,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 12:05:20,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:20,566 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 12:05:20,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:20,639 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:20,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 12:05:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:20,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 12:05:20,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:20,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:20,732 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 12:05:20,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 12:05:20,774 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:05:20,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2022-12-13 12:05:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:20,812 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2022-12-13 12:05:20,813 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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 12:05:21,142 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand has 11 states, 11 states have (on average 1.4545454545454546) 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) Result 333 states and 488 transitions. Complement of second has 134 states 23 powerset states111 rank states. The highest rank that occured is 5 [2022-12-13 12:05:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 7 stem states 7 non-accepting loop states 2 accepting loop states [2022-12-13 12:05:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) 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 12:05:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-12-13 12:05:21,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 9 letters. Loop has 7 letters. [2022-12-13 12:05:21,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:21,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 16 letters. Loop has 7 letters. [2022-12-13 12:05:21,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:21,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 9 letters. Loop has 14 letters. [2022-12-13 12:05:21,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 12:05:21,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 488 transitions. [2022-12-13 12:05:21,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2022-12-13 12:05:21,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 277 states and 406 transitions. [2022-12-13 12:05:21,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-12-13 12:05:21,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-12-13 12:05:21,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 277 states and 406 transitions. [2022-12-13 12:05:21,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:21,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 277 states and 406 transitions. [2022-12-13 12:05:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states and 406 transitions. [2022-12-13 12:05:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 128. [2022-12-13 12:05:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 12:05:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 211 transitions. [2022-12-13 12:05:21,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 211 transitions. [2022-12-13 12:05:21,174 INFO L428 stractBuchiCegarLoop]: Abstraction has 128 states and 211 transitions. [2022-12-13 12:05:21,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 12:05:21,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 211 transitions. [2022-12-13 12:05:21,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2022-12-13 12:05:21,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:21,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:21,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 12:05:21,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-12-13 12:05:21,177 INFO L748 eck$LassoCheckResult]: Stem: 1975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1976#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 1993#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1990#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 1989#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1988#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 1987#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1986#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2067#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2066#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1979#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 1969#L556-3 [2022-12-13 12:05:21,177 INFO L750 eck$LassoCheckResult]: Loop: 1969#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1970#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 1965#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 1966#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 1973#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2053#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2051#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 1969#L556-3 [2022-12-13 12:05:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2038480497, now seen corresponding path program 3 times [2022-12-13 12:05:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:21,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418292313] [2022-12-13 12:05:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:21,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:21,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 247318912, now seen corresponding path program 3 times [2022-12-13 12:05:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621581950] [2022-12-13 12:05:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:21,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:21,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -693482446, now seen corresponding path program 4 times [2022-12-13 12:05:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754049515] [2022-12-13 12:05:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:21,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754049515] [2022-12-13 12:05:21,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754049515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:21,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275417597] [2022-12-13 12:05:21,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:05:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:21,615 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:21,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-13 12:05:21,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:05:21,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:21,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 12:05:21,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:21,732 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 12:05:21,779 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 12:05:21,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 33 [2022-12-13 12:05:21,862 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 12:05:21,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-12-13 12:05:21,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:05:21,925 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:05:21,925 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 29 treesize of output 17 [2022-12-13 12:05:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:21,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:22,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2022-12-13 12:05:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:22,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275417597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:22,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:22,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-12-13 12:05:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221744225] [2022-12-13 12:05:22,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 12:05:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-12-13 12:05:22,380 INFO L87 Difference]: Start difference. First operand 128 states and 211 transitions. cyclomatic complexity: 93 Second operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 28 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 12:05:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:22,909 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2022-12-13 12:05:22,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 208 transitions. [2022-12-13 12:05:22,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-12-13 12:05:22,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 87 states and 120 transitions. [2022-12-13 12:05:22,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-12-13 12:05:22,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-12-13 12:05:22,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 120 transitions. [2022-12-13 12:05:22,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:22,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 120 transitions. [2022-12-13 12:05:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 120 transitions. [2022-12-13 12:05:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-12-13 12:05:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.411764705882353) internal successors, (96), 67 states have internal predecessors, (96), 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 12:05:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-12-13 12:05:22,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-12-13 12:05:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:05:22,917 INFO L428 stractBuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-12-13 12:05:22,917 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 12:05:22,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2022-12-13 12:05:22,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-12-13 12:05:22,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:22,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:22,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:22,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 4, 2, 2, 2, 2] [2022-12-13 12:05:22,918 INFO L748 eck$LassoCheckResult]: Stem: 2409#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2410#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 2399#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2451#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2449#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2446#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2442#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2432#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2431#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2429#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2428#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2404#L554-3 [2022-12-13 12:05:22,918 INFO L750 eck$LassoCheckResult]: Loop: 2404#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2405#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2400#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2401#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2411#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2421#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2454#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2440#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2395#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2396#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2407#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2459#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2458#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2457#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2455#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2456#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2453#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2416#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2404#L554-3 [2022-12-13 12:05:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2038429147, now seen corresponding path program 5 times [2022-12-13 12:05:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:22,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420916049] [2022-12-13 12:05:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:22,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:22,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1300186431, now seen corresponding path program 4 times [2022-12-13 12:05:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:22,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538670256] [2022-12-13 12:05:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:23,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538670256] [2022-12-13 12:05:23,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538670256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961786480] [2022-12-13 12:05:23,637 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:05:23,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:23,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:23,638 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:23,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-13 12:05:23,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:05:23,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:23,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 12:05:23,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:23,709 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 12:05:23,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:23,776 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:23,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:23,861 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:23,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:05:23,906 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:23,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:05:23,940 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:23,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:23,974 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:23,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:05:24,014 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:05:24,015 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 29 treesize of output 13 [2022-12-13 12:05:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:24,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:24,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961786480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:24,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:24,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-12-13 12:05:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784957624] [2022-12-13 12:05:24,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:24,472 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 12:05:24,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-12-13 12:05:24,473 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 33 Second operand has 30 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 30 states have internal predecessors, (47), 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 12:05:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:24,954 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2022-12-13 12:05:24,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 122 transitions. [2022-12-13 12:05:24,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2022-12-13 12:05:24,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 85 states and 117 transitions. [2022-12-13 12:05:24,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-12-13 12:05:24,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-12-13 12:05:24,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 117 transitions. [2022-12-13 12:05:24,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:24,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 117 transitions. [2022-12-13 12:05:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 117 transitions. [2022-12-13 12:05:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-12-13 12:05:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.394736842105263) internal successors, (106), 75 states have internal predecessors, (106), 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 12:05:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2022-12-13 12:05:24,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 106 transitions. [2022-12-13 12:05:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 12:05:24,961 INFO L428 stractBuchiCegarLoop]: Abstraction has 76 states and 106 transitions. [2022-12-13 12:05:24,961 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 12:05:24,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 106 transitions. [2022-12-13 12:05:24,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2022-12-13 12:05:24,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:24,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:24,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:24,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 6, 2, 2, 2, 2] [2022-12-13 12:05:24,962 INFO L748 eck$LassoCheckResult]: Stem: 2727#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 2734#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2743#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2772#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2739#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2740#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2737#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2736#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2738#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2780#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2747#L554-3 [2022-12-13 12:05:24,962 INFO L750 eck$LassoCheckResult]: Loop: 2747#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2731#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2732#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2729#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2721#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2722#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2790#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2756#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2788#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2757#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2785#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2723#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 2724#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 2782#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2781#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2719#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2720#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2789#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2787#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 2786#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 2784#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 2750#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 2747#L554-3 [2022-12-13 12:05:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2038429147, now seen corresponding path program 6 times [2022-12-13 12:05:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16426444] [2022-12-13 12:05:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:24,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:24,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1398519455, now seen corresponding path program 5 times [2022-12-13 12:05:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966822525] [2022-12-13 12:05:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:25,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966822525] [2022-12-13 12:05:25,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966822525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786053987] [2022-12-13 12:05:25,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:05:25,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:25,827 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:25,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-13 12:05:25,911 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-13 12:05:25,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:25,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 12:05:25,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:25,918 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 12:05:25,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:25,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:26,015 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:26,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:26,111 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:26,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:05:26,151 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:26,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:05:26,188 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:26,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:26,220 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:26,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:26,254 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:26,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:05:26,280 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:05:26,280 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 29 treesize of output 13 [2022-12-13 12:05:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:26,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:26,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786053987] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:26,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:26,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2022-12-13 12:05:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864853285] [2022-12-13 12:05:26,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:26,788 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 12:05:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=981, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 12:05:26,789 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. cyclomatic complexity: 35 Second operand has 35 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 12:05:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:27,344 INFO L93 Difference]: Finished difference Result 142 states and 200 transitions. [2022-12-13 12:05:27,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 200 transitions. [2022-12-13 12:05:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-12-13 12:05:27,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 138 states and 195 transitions. [2022-12-13 12:05:27,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-12-13 12:05:27,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-12-13 12:05:27,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 195 transitions. [2022-12-13 12:05:27,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:27,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 195 transitions. [2022-12-13 12:05:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 195 transitions. [2022-12-13 12:05:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2022-12-13 12:05:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 100 states have internal predecessors, (138), 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 12:05:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2022-12-13 12:05:27,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 138 transitions. [2022-12-13 12:05:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 12:05:27,351 INFO L428 stractBuchiCegarLoop]: Abstraction has 101 states and 138 transitions. [2022-12-13 12:05:27,351 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 12:05:27,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 138 transitions. [2022-12-13 12:05:27,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-12-13 12:05:27,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:27,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:27,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:27,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 8, 2, 2, 2, 2] [2022-12-13 12:05:27,352 INFO L748 eck$LassoCheckResult]: Stem: 3135#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 3142#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3160#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3173#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3154#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3155#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3194#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3191#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3152#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3151#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3153#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3206#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3132#L554-3 [2022-12-13 12:05:27,352 INFO L750 eck$LassoCheckResult]: Loop: 3132#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3133#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3139#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3137#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3130#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3131#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3222#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3170#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3221#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3166#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3213#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3167#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3123#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3124#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3203#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3209#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3207#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3208#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3220#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3219#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3218#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3217#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3216#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3215#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3214#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3148#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3132#L554-3 [2022-12-13 12:05:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -425271712, now seen corresponding path program 7 times [2022-12-13 12:05:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:27,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851201853] [2022-12-13 12:05:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:27,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:27,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash -955419263, now seen corresponding path program 6 times [2022-12-13 12:05:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:27,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251714259] [2022-12-13 12:05:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251714259] [2022-12-13 12:05:28,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251714259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208040227] [2022-12-13 12:05:28,234 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 12:05:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:28,235 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:28,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-13 12:05:28,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-12-13 12:05:28,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:28,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 12:05:28,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:28,354 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 12:05:28,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:28,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:28,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:28,456 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:28,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:28,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 12:05:28,531 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-13 12:05:28,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-12-13 12:05:28,624 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-12-13 12:05:28,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-12-13 12:05:28,761 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:28,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:28,870 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:28,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:28,963 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:28,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:29,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:05:29,022 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 45 treesize of output 37 [2022-12-13 12:05:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:29,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208040227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:42,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:42,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2022-12-13 12:05:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960712957] [2022-12-13 12:05:42,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:42,043 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 12:05:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=938, Unknown=1, NotChecked=0, Total=1122 [2022-12-13 12:05:42,044 INFO L87 Difference]: Start difference. First operand 101 states and 138 transitions. cyclomatic complexity: 42 Second operand has 34 states, 34 states have (on average 1.7941176470588236) 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 12:05:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:43,043 INFO L93 Difference]: Finished difference Result 217 states and 307 transitions. [2022-12-13 12:05:43,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 307 transitions. [2022-12-13 12:05:43,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-12-13 12:05:43,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 213 states and 302 transitions. [2022-12-13 12:05:43,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2022-12-13 12:05:43,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-12-13 12:05:43,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 302 transitions. [2022-12-13 12:05:43,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:43,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 213 states and 302 transitions. [2022-12-13 12:05:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 302 transitions. [2022-12-13 12:05:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 161. [2022-12-13 12:05:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 160 states have internal predecessors, (227), 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 12:05:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2022-12-13 12:05:43,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 227 transitions. [2022-12-13 12:05:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 12:05:43,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 161 states and 227 transitions. [2022-12-13 12:05:43,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 12:05:43,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 227 transitions. [2022-12-13 12:05:43,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-12-13 12:05:43,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:43,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:43,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:43,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 10, 2, 2, 2, 2] [2022-12-13 12:05:43,051 INFO L748 eck$LassoCheckResult]: Stem: 3680#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3681#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 3686#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3703#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3715#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3722#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3721#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3713#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3735#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3736#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3771#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3697#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3696#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3698#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3772#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3691#L554-3 [2022-12-13 12:05:43,051 INFO L750 eck$LassoCheckResult]: Loop: 3691#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3795#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3789#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3682#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3673#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3674#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3824#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3742#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3823#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3738#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3822#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3708#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3804#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3709#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3802#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3792#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 3678#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 3812#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3811#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3671#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3672#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3810#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3809#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3808#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3807#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3806#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3801#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 3800#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 3799#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 3693#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 3691#L554-3 [2022-12-13 12:05:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -664170533, now seen corresponding path program 8 times [2022-12-13 12:05:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:43,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648420494] [2022-12-13 12:05:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:43,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:43,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1091821791, now seen corresponding path program 7 times [2022-12-13 12:05:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:43,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644200] [2022-12-13 12:05:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 14 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:44,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644200] [2022-12-13 12:05:44,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644200] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:44,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326540023] [2022-12-13 12:05:44,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 12:05:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:44,320 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:44,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-13 12:05:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:44,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 12:05:44,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:44,441 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 12:05:44,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:44,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:44,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:44,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:44,616 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:44,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:44,723 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:44,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:05:44,777 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:44,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:05:44,817 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:44,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:44,855 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:44,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:44,893 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:44,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:44,937 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:05:44,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:05:44,986 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:05:44,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:05:45,029 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:05:45,029 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 29 treesize of output 13 [2022-12-13 12:05:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 29 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:45,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 26 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:46,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326540023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:46,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:46,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2022-12-13 12:05:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961088542] [2022-12-13 12:05:46,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:46,162 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 12:05:46,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2022-12-13 12:05:46,163 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. cyclomatic complexity: 71 Second operand has 45 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 45 states have internal predecessors, (75), 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 12:05:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:47,451 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2022-12-13 12:05:47,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299 states and 423 transitions. [2022-12-13 12:05:47,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-12-13 12:05:47,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299 states to 295 states and 418 transitions. [2022-12-13 12:05:47,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-12-13 12:05:47,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-12-13 12:05:47,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 418 transitions. [2022-12-13 12:05:47,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:47,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 418 transitions. [2022-12-13 12:05:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 418 transitions. [2022-12-13 12:05:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 235. [2022-12-13 12:05:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 235 states have (on average 1.4170212765957446) internal successors, (333), 234 states have internal predecessors, (333), 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 12:05:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 333 transitions. [2022-12-13 12:05:47,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 235 states and 333 transitions. [2022-12-13 12:05:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 12:05:47,458 INFO L428 stractBuchiCegarLoop]: Abstraction has 235 states and 333 transitions. [2022-12-13 12:05:47,458 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 12:05:47,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 333 transitions. [2022-12-13 12:05:47,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 12:05:47,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:47,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:47,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:47,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 12, 2, 2, 2, 2] [2022-12-13 12:05:47,460 INFO L748 eck$LassoCheckResult]: Stem: 4409#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4410#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 4418#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4437#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4448#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4455#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4454#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4446#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4470#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4471#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4496#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4431#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4432#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4443#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4442#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4444#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4517#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4421#L554-3 [2022-12-13 12:05:47,460 INFO L750 eck$LassoCheckResult]: Loop: 4421#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4414#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4415#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4411#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4412#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4509#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4601#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4484#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4576#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4477#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4572#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4473#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4571#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4429#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4570#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4546#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4568#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4569#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 4603#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 4564#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4559#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4560#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4629#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4403#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4402#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4413#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4628#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4627#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4626#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4625#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4600#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 4599#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 4598#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 4424#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 4421#L554-3 [2022-12-13 12:05:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1682296470, now seen corresponding path program 9 times [2022-12-13 12:05:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717377941] [2022-12-13 12:05:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:47,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:47,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1381508673, now seen corresponding path program 8 times [2022-12-13 12:05:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854434115] [2022-12-13 12:05:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 27 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854434115] [2022-12-13 12:05:48,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854434115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:48,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628257264] [2022-12-13 12:05:48,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:05:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:48,877 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:48,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-13 12:05:48,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:05:48,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 12:05:48,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:49,001 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 12:05:49,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:49,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:49,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:49,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:49,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:49,217 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:49,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:49,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 12:05:49,320 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-13 12:05:49,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-12-13 12:05:49,415 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-12-13 12:05:49,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-12-13 12:05:49,578 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:49,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:49,694 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:49,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:49,789 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:49,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:49,907 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:49,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:50,006 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:50,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:50,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:05:50,090 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 45 treesize of output 37 [2022-12-13 12:05:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 46 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:50,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:05:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 29 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:52,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628257264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:05:52,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:05:52,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 45 [2022-12-13 12:05:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448634927] [2022-12-13 12:05:52,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:05:52,553 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:05:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 12:05:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2022-12-13 12:05:52,553 INFO L87 Difference]: Start difference. First operand 235 states and 333 transitions. cyclomatic complexity: 103 Second operand has 45 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 45 states have internal predecessors, (80), 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 12:05:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:05:54,206 INFO L93 Difference]: Finished difference Result 389 states and 549 transitions. [2022-12-13 12:05:54,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 389 states and 549 transitions. [2022-12-13 12:05:54,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-12-13 12:05:54,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 389 states to 385 states and 544 transitions. [2022-12-13 12:05:54,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-12-13 12:05:54,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-12-13 12:05:54,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 544 transitions. [2022-12-13 12:05:54,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:05:54,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 385 states and 544 transitions. [2022-12-13 12:05:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 544 transitions. [2022-12-13 12:05:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 317. [2022-12-13 12:05:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 317 states have (on average 1.416403785488959) internal successors, (449), 316 states have internal predecessors, (449), 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 12:05:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 449 transitions. [2022-12-13 12:05:54,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 317 states and 449 transitions. [2022-12-13 12:05:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 12:05:54,215 INFO L428 stractBuchiCegarLoop]: Abstraction has 317 states and 449 transitions. [2022-12-13 12:05:54,215 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 12:05:54,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 449 transitions. [2022-12-13 12:05:54,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-12-13 12:05:54,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:05:54,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:05:54,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:54,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 14, 2, 2, 2, 2] [2022-12-13 12:05:54,217 INFO L748 eck$LassoCheckResult]: Stem: 5333#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 5339#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5358#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5370#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5377#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5376#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5368#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5390#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5391#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5414#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5415#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5430#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5354#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5355#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5350#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5349#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5351#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5472#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5343#L554-3 [2022-12-13 12:05:54,217 INFO L750 eck$LassoCheckResult]: Loop: 5343#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5533#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5526#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5335#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5327#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5328#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5635#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5474#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5634#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5418#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5633#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5397#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5632#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5393#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5631#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5363#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5540#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5364#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5536#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5531#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 5532#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 5530#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5607#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5325#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5326#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5606#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5605#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5572#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5571#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5548#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5545#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5544#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5543#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5542#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5539#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 5538#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 5537#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 5346#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 5343#L554-3 [2022-12-13 12:05:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1779255953, now seen corresponding path program 10 times [2022-12-13 12:05:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:54,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770443338] [2022-12-13 12:05:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:54,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:54,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -162436383, now seen corresponding path program 9 times [2022-12-13 12:05:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:54,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990978010] [2022-12-13 12:05:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 41 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990978010] [2022-12-13 12:05:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990978010] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:05:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618349599] [2022-12-13 12:05:55,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:05:55,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:05:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:05:55,802 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:05:55,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-13 12:05:56,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-13 12:05:56,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:05:56,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 12:05:56,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:05:56,042 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 12:05:56,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:05:56,322 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:56,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:05:56,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 12:05:56,439 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-13 12:05:56,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-12-13 12:05:56,563 INFO L321 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2022-12-13 12:05:56,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 72 [2022-12-13 12:05:56,740 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:56,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:56,880 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:56,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:57,008 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:57,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:57,111 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:57,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:57,248 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:57,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:57,380 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:05:57,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:05:57,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:05:57,510 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 45 treesize of output 37 [2022-12-13 12:05:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 60 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:05:57,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:06:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 40 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:16,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618349599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:06:16,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:06:16,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 51 [2022-12-13 12:06:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893450328] [2022-12-13 12:06:16,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:06:16,566 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:06:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 12:06:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2157, Unknown=0, NotChecked=0, Total=2550 [2022-12-13 12:06:16,567 INFO L87 Difference]: Start difference. First operand 317 states and 449 transitions. cyclomatic complexity: 137 Second operand has 51 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 51 states have internal predecessors, (93), 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 12:06:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:18,343 INFO L93 Difference]: Finished difference Result 487 states and 685 transitions. [2022-12-13 12:06:18,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 487 states and 685 transitions. [2022-12-13 12:06:18,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2022-12-13 12:06:18,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 487 states to 483 states and 680 transitions. [2022-12-13 12:06:18,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2022-12-13 12:06:18,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2022-12-13 12:06:18,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 680 transitions. [2022-12-13 12:06:18,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:06:18,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 483 states and 680 transitions. [2022-12-13 12:06:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 680 transitions. [2022-12-13 12:06:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 407. [2022-12-13 12:06:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 407 states have (on average 1.4127764127764129) internal successors, (575), 406 states have internal predecessors, (575), 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 12:06:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 575 transitions. [2022-12-13 12:06:18,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 407 states and 575 transitions. [2022-12-13 12:06:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 12:06:18,355 INFO L428 stractBuchiCegarLoop]: Abstraction has 407 states and 575 transitions. [2022-12-13 12:06:18,355 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 12:06:18,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 575 transitions. [2022-12-13 12:06:18,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2022-12-13 12:06:18,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:06:18,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:06:18,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:18,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 16, 2, 2, 2, 2] [2022-12-13 12:06:18,357 INFO L748 eck$LassoCheckResult]: Stem: 6471#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 6480#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6498#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6510#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6517#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6516#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6508#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6530#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6531#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6554#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6555#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6569#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6570#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6606#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6494#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6495#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6490#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6489#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6491#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6653#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6485#L554-3 [2022-12-13 12:06:18,357 INFO L750 eck$LassoCheckResult]: Loop: 6485#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6476#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6477#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6854#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6825#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6646#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6823#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6643#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6787#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6609#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6754#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6573#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6732#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6537#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6728#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6533#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6727#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6503#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6726#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6504#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6724#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6725#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 6826#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 6720#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6710#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6711#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6864#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6465#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6464#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6475#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6863#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6862#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6861#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6860#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6859#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6858#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6857#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6856#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6843#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 6855#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 6473#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 6474#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 6485#L554-3 [2022-12-13 12:06:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash 468038604, now seen corresponding path program 11 times [2022-12-13 12:06:18,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:18,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884551003] [2022-12-13 12:06:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:18,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:18,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 213896449, now seen corresponding path program 10 times [2022-12-13 12:06:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:18,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338464420] [2022-12-13 12:06:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 41 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:20,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338464420] [2022-12-13 12:06:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338464420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:06:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548481864] [2022-12-13 12:06:20,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:06:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:20,340 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:06:20,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-13 12:06:20,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:06:20,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:06:20,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 12:06:20,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:06:20,464 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 12:06:20,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:20,757 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:20,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:06:20,884 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:06:20,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:06:20,957 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:20,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:06:21,007 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,052 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,098 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,145 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,194 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,246 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,300 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:21,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:21,362 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:06:21,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:06:21,419 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:06:21,419 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 29 treesize of output 13 [2022-12-13 12:06:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 68 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:21,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:06:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 62 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:25,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548481864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:06:25,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:06:25,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 60 [2022-12-13 12:06:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439468822] [2022-12-13 12:06:25,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:06:25,335 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:06:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-13 12:06:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2976, Unknown=0, NotChecked=0, Total=3540 [2022-12-13 12:06:25,337 INFO L87 Difference]: Start difference. First operand 407 states and 575 transitions. cyclomatic complexity: 173 Second operand has 60 states, 60 states have (on average 1.75) internal successors, (105), 60 states have internal predecessors, (105), 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 12:06:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:27,147 INFO L93 Difference]: Finished difference Result 593 states and 831 transitions. [2022-12-13 12:06:27,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 593 states and 831 transitions. [2022-12-13 12:06:27,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-12-13 12:06:27,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 593 states to 589 states and 826 transitions. [2022-12-13 12:06:27,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-12-13 12:06:27,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-12-13 12:06:27,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 589 states and 826 transitions. [2022-12-13 12:06:27,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:06:27,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 589 states and 826 transitions. [2022-12-13 12:06:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states and 826 transitions. [2022-12-13 12:06:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 505. [2022-12-13 12:06:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 505 states have (on average 1.4079207920792078) internal successors, (711), 504 states have internal predecessors, (711), 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 12:06:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 711 transitions. [2022-12-13 12:06:27,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 505 states and 711 transitions. [2022-12-13 12:06:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 12:06:27,160 INFO L428 stractBuchiCegarLoop]: Abstraction has 505 states and 711 transitions. [2022-12-13 12:06:27,160 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 12:06:27,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 711 transitions. [2022-12-13 12:06:27,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-12-13 12:06:27,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:06:27,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:06:27,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:27,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 18, 2, 2, 2, 2] [2022-12-13 12:06:27,162 INFO L748 eck$LassoCheckResult]: Stem: 7840#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7841#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 7849#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 7868#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 7901#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7899#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7896#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7895#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7893#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7894#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7922#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7923#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7941#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7942#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7978#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7979#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8016#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7864#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7865#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7860#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7859#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7861#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8065#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8066#L554-3 [2022-12-13 12:06:27,162 INFO L750 eck$LassoCheckResult]: Loop: 8066#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 8141#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 8134#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7845#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7838#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7839#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8334#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8068#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8333#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8019#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8332#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7982#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8331#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7945#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8330#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7909#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8329#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7879#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8328#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7875#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8151#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7876#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8144#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8145#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 8153#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 8140#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8130#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 7836#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 7837#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8295#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8294#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8257#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8254#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8218#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8217#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8186#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8183#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8158#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8157#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8156#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8155#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8154#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8149#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 8315#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 8314#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 8303#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 8066#L554-3 [2022-12-13 12:06:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1186416057, now seen corresponding path program 12 times [2022-12-13 12:06:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:27,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052583896] [2022-12-13 12:06:27,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:27,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:27,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1703727967, now seen corresponding path program 11 times [2022-12-13 12:06:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:27,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407959803] [2022-12-13 12:06:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 66 proven. 317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407959803] [2022-12-13 12:06:29,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407959803] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:06:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552486203] [2022-12-13 12:06:29,314 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 12:06:29,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:29,315 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:06:29,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-13 12:06:29,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-12-13 12:06:29,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:06:29,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 12:06:29,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:06:29,847 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 12:06:29,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:29,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:29,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:29,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:30,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:30,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:30,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:30,162 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:30,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:06:30,293 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:06:30,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:06:30,364 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:06:30,410 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,458 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,512 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,559 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,611 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,662 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,714 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,770 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:06:30,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:06:30,827 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:06:30,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:06:30,881 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:06:30,881 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 29 treesize of output 13 [2022-12-13 12:06:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 85 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:30,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:06:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 78 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:33,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552486203] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:06:33,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:06:33,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 63 [2022-12-13 12:06:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738173537] [2022-12-13 12:06:33,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:06:33,971 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:06:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 12:06:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3270, Unknown=0, NotChecked=0, Total=3906 [2022-12-13 12:06:33,972 INFO L87 Difference]: Start difference. First operand 505 states and 711 transitions. cyclomatic complexity: 211 Second operand has 63 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 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 12:06:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:35,963 INFO L93 Difference]: Finished difference Result 707 states and 987 transitions. [2022-12-13 12:06:35,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 707 states and 987 transitions. [2022-12-13 12:06:35,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2022-12-13 12:06:35,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 707 states to 703 states and 982 transitions. [2022-12-13 12:06:35,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2022-12-13 12:06:35,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2022-12-13 12:06:35,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 703 states and 982 transitions. [2022-12-13 12:06:35,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:06:35,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 703 states and 982 transitions. [2022-12-13 12:06:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states and 982 transitions. [2022-12-13 12:06:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 611. [2022-12-13 12:06:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 611 states have (on average 1.4026186579378068) internal successors, (857), 610 states have internal predecessors, (857), 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 12:06:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 857 transitions. [2022-12-13 12:06:35,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 611 states and 857 transitions. [2022-12-13 12:06:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 12:06:35,976 INFO L428 stractBuchiCegarLoop]: Abstraction has 611 states and 857 transitions. [2022-12-13 12:06:35,976 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 12:06:35,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 611 states and 857 transitions. [2022-12-13 12:06:35,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2022-12-13 12:06:35,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:06:35,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:06:35,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:35,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 20, 2, 2, 2, 2] [2022-12-13 12:06:35,978 INFO L748 eck$LassoCheckResult]: Stem: 9462#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 9471#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9489#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9500#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9507#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9506#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9498#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9522#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9523#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9548#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9549#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9563#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9564#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9598#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9599#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9637#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9638#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9680#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9483#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9484#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9495#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9494#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9496#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 9735#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9736#L554-3 [2022-12-13 12:06:35,978 INFO L750 eck$LassoCheckResult]: Loop: 9736#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9467#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9468#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9464#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9465#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9729#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10012#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9725#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9968#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9683#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9926#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9641#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9887#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9602#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9854#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9536#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9831#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9529#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9827#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9525#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9826#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9480#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9825#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9779#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 9824#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9819#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 9818#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 9817#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9808#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9809#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10058#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9456#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9455#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9466#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10057#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10056#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10055#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10054#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10053#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10052#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10051#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10050#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10049#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10048#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10047#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 10046#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9925#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 9924#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 9923#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 9476#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 9736#L554-3 [2022-12-13 12:06:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 13 times [2022-12-13 12:06:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:35,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729207392] [2022-12-13 12:06:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:36,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:36,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2099472833, now seen corresponding path program 12 times [2022-12-13 12:06:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:36,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599921826] [2022-12-13 12:06:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 69 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:38,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599921826] [2022-12-13 12:06:38,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599921826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:06:38,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058899192] [2022-12-13 12:06:38,524 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 12:06:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:06:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:38,525 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:06:38,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-13 12:06:39,112 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-12-13 12:06:39,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:06:39,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 12:06:39,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:06:39,123 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 12:06:39,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:06:39,484 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:39,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:06:39,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 12:06:39,597 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-13 12:06:39,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-12-13 12:06:39,740 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:39,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2022-12-13 12:06:39,861 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:39,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:39,975 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:39,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,075 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,182 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,332 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,444 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,582 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,709 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,818 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:06:40,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:06:40,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:06:40,915 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 45 treesize of output 37 [2022-12-13 12:06:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 114 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:06:40,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:06:57,701 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:07:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 85 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:52,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058899192] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:07:52,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:07:52,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 65 [2022-12-13 12:07:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637620913] [2022-12-13 12:07:52,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:07:52,267 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:07:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 12:07:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=3519, Unknown=2, NotChecked=0, Total=4160 [2022-12-13 12:07:52,268 INFO L87 Difference]: Start difference. First operand 611 states and 857 transitions. cyclomatic complexity: 251 Second operand has 65 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 65 states have internal predecessors, (123), 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 12:07:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:07:55,641 INFO L93 Difference]: Finished difference Result 829 states and 1153 transitions. [2022-12-13 12:07:55,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 829 states and 1153 transitions. [2022-12-13 12:07:55,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2022-12-13 12:07:55,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 829 states to 825 states and 1148 transitions. [2022-12-13 12:07:55,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2022-12-13 12:07:55,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-12-13 12:07:55,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 1148 transitions. [2022-12-13 12:07:55,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:07:55,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1148 transitions. [2022-12-13 12:07:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1148 transitions. [2022-12-13 12:07:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 725. [2022-12-13 12:07:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 725 states have (on average 1.3972413793103449) internal successors, (1013), 724 states have internal predecessors, (1013), 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 12:07:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1013 transitions. [2022-12-13 12:07:55,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 725 states and 1013 transitions. [2022-12-13 12:07:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 12:07:55,655 INFO L428 stractBuchiCegarLoop]: Abstraction has 725 states and 1013 transitions. [2022-12-13 12:07:55,655 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 12:07:55,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 725 states and 1013 transitions. [2022-12-13 12:07:55,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-12-13 12:07:55,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:07:55,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:07:55,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:55,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 22, 2, 2, 2, 2] [2022-12-13 12:07:55,658 INFO L748 eck$LassoCheckResult]: Stem: 11333#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 11347#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11365#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11377#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11384#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11383#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11375#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11397#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11398#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11421#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11422#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11438#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11439#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11473#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11474#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11512#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11513#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11555#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11556#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11642#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11361#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11362#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11357#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11356#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11358#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 11742#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11743#L554-3 [2022-12-13 12:07:55,658 INFO L750 eck$LassoCheckResult]: Loop: 11743#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11343#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11344#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11340#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11341#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11637#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11995#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11628#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11947#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11591#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11903#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11559#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11863#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11516#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11827#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11477#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11789#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11425#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11766#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11404#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11762#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11400#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11761#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11371#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11760#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11370#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 11325#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11326#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 11755#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 11754#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11744#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11745#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12048#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11332#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11331#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11342#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12047#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12046#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12045#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12044#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12043#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12042#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12041#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12040#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12039#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12038#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12037#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12036#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12035#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 12034#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11824#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 11823#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 11822#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 11353#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 11743#L554-3 [2022-12-13 12:07:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 423190269, now seen corresponding path program 14 times [2022-12-13 12:07:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:55,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823574545] [2022-12-13 12:07:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:07:55,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:07:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:07:55,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:07:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 561013857, now seen corresponding path program 13 times [2022-12-13 12:07:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393140738] [2022-12-13 12:07:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 86 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:07:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393140738] [2022-12-13 12:07:58,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393140738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:07:58,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632832187] [2022-12-13 12:07:58,798 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 12:07:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:07:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:07:58,799 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:07:58,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-13 12:07:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:58,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 12:07:58,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:07:58,935 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 12:07:58,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:07:59,514 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:07:59,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:07:59,734 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:07:59,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 12:07:59,822 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:07:59,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-12-13 12:07:59,883 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:07:59,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:07:59,934 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:07:59,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:07:59,990 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:07:59,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,048 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,107 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,169 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,256 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,335 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,414 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,496 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:08:00,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 12:08:00,587 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-12-13 12:08:00,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 35 [2022-12-13 12:08:00,672 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:08:00,672 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 29 treesize of output 13 [2022-12-13 12:08:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 125 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:00,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:08:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 116 proven. 439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632832187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:08:33,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:08:33,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 75 [2022-12-13 12:08:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68032607] [2022-12-13 12:08:33,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:08:33,914 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:08:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-13 12:08:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=4676, Unknown=1, NotChecked=0, Total=5550 [2022-12-13 12:08:33,915 INFO L87 Difference]: Start difference. First operand 725 states and 1013 transitions. cyclomatic complexity: 293 Second operand has 75 states, 75 states have (on average 1.8) internal successors, (135), 75 states have internal predecessors, (135), 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 12:08:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:08:38,801 INFO L93 Difference]: Finished difference Result 959 states and 1329 transitions. [2022-12-13 12:08:38,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 1329 transitions. [2022-12-13 12:08:38,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-12-13 12:08:38,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 955 states and 1324 transitions. [2022-12-13 12:08:38,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2022-12-13 12:08:38,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2022-12-13 12:08:38,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 955 states and 1324 transitions. [2022-12-13 12:08:38,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:08:38,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 955 states and 1324 transitions. [2022-12-13 12:08:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states and 1324 transitions. [2022-12-13 12:08:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 847. [2022-12-13 12:08:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 847 states have (on average 1.3919716646989375) internal successors, (1179), 846 states have internal predecessors, (1179), 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 12:08:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1179 transitions. [2022-12-13 12:08:38,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 847 states and 1179 transitions. [2022-12-13 12:08:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 12:08:38,817 INFO L428 stractBuchiCegarLoop]: Abstraction has 847 states and 1179 transitions. [2022-12-13 12:08:38,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-12-13 12:08:38,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 847 states and 1179 transitions. [2022-12-13 12:08:38,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-12-13 12:08:38,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:08:38,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:08:38,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:38,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 24, 2, 2, 2, 2] [2022-12-13 12:08:38,820 INFO L748 eck$LassoCheckResult]: Stem: 13496#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13497#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 13505#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13523#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13535#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13542#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13541#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13533#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13558#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13559#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13584#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13585#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13599#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13600#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13634#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13635#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13673#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13674#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13716#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13717#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13797#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13798#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13847#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13518#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13519#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13530#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13529#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13531#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 13962#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13963#L554-3 [2022-12-13 12:08:38,820 INFO L750 eck$LassoCheckResult]: Loop: 13963#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13978#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13967#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13501#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13494#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13495#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14332#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13834#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14331#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13789#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14330#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13752#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14329#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13720#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14328#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13677#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14327#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13638#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14326#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13572#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14325#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13565#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14324#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13561#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14323#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13516#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14288#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13515#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 14280#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13979#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 13980#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 13977#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13964#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13492#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13493#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14278#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14276#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14226#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14225#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14177#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14176#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14132#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14131#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14091#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14090#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14054#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14053#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14020#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14019#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13994#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13993#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13992#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13991#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 13990#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13985#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 14290#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 14289#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 14286#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 13963#L554-3 [2022-12-13 12:08:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1335993032, now seen corresponding path program 15 times [2022-12-13 12:08:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:38,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189560386] [2022-12-13 12:08:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:38,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:08:38,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:08:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:08:38,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:08:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1193149311, now seen corresponding path program 14 times [2022-12-13 12:08:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:38,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625966481] [2022-12-13 12:08:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 123 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625966481] [2022-12-13 12:08:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625966481] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:08:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420901613] [2022-12-13 12:08:42,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:08:42,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:08:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:08:42,734 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:08:42,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-13 12:08:42,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:08:42,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:08:42,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 12:08:42,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:08:42,894 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 12:08:42,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:42,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:08:43,733 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:43,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 12:08:43,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-12-13 12:08:43,902 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-13 12:08:43,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-12-13 12:08:44,107 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:44,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2022-12-13 12:08:44,255 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:44,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:44,483 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:44,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:44,718 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:44,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:44,930 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:44,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:45,169 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:45,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:45,404 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:45,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:45,639 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:45,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:45,954 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:45,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:46,169 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:46,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:46,461 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:46,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:46,670 INFO L321 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-12-13 12:08:46,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 58 [2022-12-13 12:08:46,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:08:46,867 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 45 treesize of output 37 [2022-12-13 12:08:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 160 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:08:46,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:09:02,505 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:11:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 125 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:11:12,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420901613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:11:12,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:11:12,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 73 [2022-12-13 12:11:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903896629] [2022-12-13 12:11:12,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:11:12,030 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:11:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:11:12,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-13 12:11:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=4427, Unknown=2, NotChecked=0, Total=5256 [2022-12-13 12:11:12,032 INFO L87 Difference]: Start difference. First operand 847 states and 1179 transitions. cyclomatic complexity: 337 Second operand has 73 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 73 states have internal predecessors, (138), 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 12:11:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:11:17,713 INFO L93 Difference]: Finished difference Result 1097 states and 1515 transitions. [2022-12-13 12:11:17,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1515 transitions. [2022-12-13 12:11:17,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-12-13 12:11:17,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 1093 states and 1510 transitions. [2022-12-13 12:11:17,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2022-12-13 12:11:17,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2022-12-13 12:11:17,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1093 states and 1510 transitions. [2022-12-13 12:11:17,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 12:11:17,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1093 states and 1510 transitions. [2022-12-13 12:11:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states and 1510 transitions. [2022-12-13 12:11:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 977. [2022-12-13 12:11:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 977 states have (on average 1.3868986693961105) internal successors, (1355), 976 states have internal predecessors, (1355), 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 12:11:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1355 transitions. [2022-12-13 12:11:17,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 977 states and 1355 transitions. [2022-12-13 12:11:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 12:11:17,732 INFO L428 stractBuchiCegarLoop]: Abstraction has 977 states and 1355 transitions. [2022-12-13 12:11:17,732 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-12-13 12:11:17,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 977 states and 1355 transitions. [2022-12-13 12:11:17,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-12-13 12:11:17,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 12:11:17,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 12:11:17,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 1, 1, 1, 1, 1, 1] [2022-12-13 12:11:17,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 26, 2, 2, 2, 2] [2022-12-13 12:11:17,734 INFO L748 eck$LassoCheckResult]: Stem: 15946#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~mem12#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem8#1, main_#t~mem9#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~n~0#1.base, main_~n~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(main_#t~nondet5#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~nondet5#1;call write~int(main_#t~nondet6#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~nondet6#1;call write~int(main_#t~nondet7#1, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~nondet7#1; 15959#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 15978#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 15989#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15996#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15995#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15987#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16011#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16012#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16039#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16040#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16055#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16056#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16090#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16091#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16129#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16130#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16172#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16173#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16253#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16254#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16302#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16304#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16348#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15973#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15974#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15984#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15983#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15985#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 16485#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 16486#L554-3 [2022-12-13 12:11:17,734 INFO L750 eck$LassoCheckResult]: Loop: 16486#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 15955#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 15956#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15953#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15944#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15945#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16912#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16339#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16911#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16290#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16910#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16245#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16909#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16208#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16908#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16176#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16907#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16133#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16895#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16094#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16883#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16025#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16882#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16018#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16881#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16014#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16515#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15971#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16511#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15970#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 15937#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 15938#L554-3 call main_#t~mem8#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~n~0#1.base, main_~n~0#1.offset, 4); 16503#L554-1 assume !!(main_#t~mem8#1 < main_#t~mem9#1);havoc main_#t~mem8#1;havoc main_#t~mem9#1;call write~int(0, main_~j~0#1.base, main_~j~0#1.offset, 4); 16498#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16499#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 15942#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 15943#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16859#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16858#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16804#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16803#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16751#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16750#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16702#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16701#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16657#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16656#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16616#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16615#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16579#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16578#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16545#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16544#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16519#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16518#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16517#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16516#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16514#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16508#L556-1 assume !!(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(1 + main_#t~mem12#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem12#1; 16879#L556-3 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 16877#L556-1 assume !(main_#t~mem10#1 <= main_#t~mem11#1);havoc main_#t~mem10#1;havoc main_#t~mem11#1; 16864#L556-4 call main_#t~mem13#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);call write~int(1 + main_#t~mem13#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem13#1; 16486#L554-3 [2022-12-13 12:11:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:11:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 305969331, now seen corresponding path program 16 times [2022-12-13 12:11:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:11:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175723044] [2022-12-13 12:11:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:11:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:11:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:11:17,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:11:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:11:17,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:11:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:11:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash -270003679, now seen corresponding path program 15 times [2022-12-13 12:11:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:11:17,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111905403] [2022-12-13 12:11:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:11:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:11:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:11:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 146 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:11:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:11:22,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111905403] [2022-12-13 12:11:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111905403] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:11:22,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700897537] [2022-12-13 12:11:22,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:11:22,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:11:22,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:11:22,563 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:11:22,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36844c1-28fb-496c-b06e-0944a1fb8772/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-13 12:11:23,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-12-13 12:11:23,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:11:23,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 128 conjunts are in the unsatisfiable core [2022-12-13 12:11:23,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:11:23,607 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 12:11:23,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:23,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:23,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:23,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:23,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:23,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:11:24,663 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-12-13 12:11:24,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2022-12-13 12:11:25,033 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-12-13 12:11:25,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 39 [2022-12-13 12:11:25,201 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-13 12:11:25,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2022-12-13 12:11:25,315 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:25,416 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:25,540 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:25,651 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:25,787 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:25,914 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:25,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,045 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,205 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,341 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,476 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,623 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,769 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-13 12:11:26,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 12:11:26,940 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-12-13 12:11:26,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2022-12-13 12:11:27,066 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:11:27,066 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 44 treesize of output 16 [2022-12-13 12:11:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 29 proven. 730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:11:27,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:11:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 31 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:11:34,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700897537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:11:34,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:11:34,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 35] total 83 [2022-12-13 12:11:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624796696] [2022-12-13 12:11:34,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:11:34,243 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 12:11:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:11:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-13 12:11:34,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=5733, Unknown=0, NotChecked=0, Total=6806 [2022-12-13 12:11:34,246 INFO L87 Difference]: Start difference. First operand 977 states and 1355 transitions. cyclomatic complexity: 383 Second operand has 83 states, 83 states have (on average 1.8313253012048192) internal successors, (152), 83 states have internal predecessors, (152), 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 12:12:30,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:12:58,241 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:13:06,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:43,901 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:13:51,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:53,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:55,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:58,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:13:59,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:01,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:03,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:04,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:05,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:07,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:09,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:10,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:14:12,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:14,876 WARN L233 SmtUtils]: Spent 17.36s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:15:15,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:20,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:23,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:25,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:28,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:31,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:34,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:36,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:39,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:15:41,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:43,451 WARN L233 SmtUtils]: Spent 19.84s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:16:45,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:47,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:48,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:50,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:51,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:55,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:56,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:57,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:16:59,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:02,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:04,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:12,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:14,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:16,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:18,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:20,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:28,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:34,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:35,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:37,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:39,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:41,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:17:43,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:19:42,475 WARN L233 SmtUtils]: Spent 33.62s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:19:43,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:19:45,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 12:19:50,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]