./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array17_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array17_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN --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 c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c --- 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-6b4ec56 [2022-11-20 10:54:53,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:54:53,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:54:53,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:54:53,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:54:53,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:54:53,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:54:53,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:54:53,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:54:53,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:54:53,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:54:53,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:54:53,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:54:53,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:54:53,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:54:53,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:54:53,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:54:53,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:54:53,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:54:53,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:54:53,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:54:53,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:54:53,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:54:53,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:54:53,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:54:53,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:54:53,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:54:53,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:54:53,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:54:53,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:54:53,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:54:53,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:54:53,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:54:53,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:54:53,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:54:53,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:54:53,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:54:53,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:54:53,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:54:53,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:54:53,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:54:53,876 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-20 10:54:53,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:54:53,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:54:53,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:54:53,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:54:53,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:54:53,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:54:53,919 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:54:53,919 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:54:53,919 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:54:53,920 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:54:53,921 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:54:53,921 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:54:53,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:54:53,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:54:53,922 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:54:53,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:54:53,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:54:53,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:54:53,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:54:53,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:54:53,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:54:53,923 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:54:53,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:54:53,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:54:53,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:54:53,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:54:53,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:54:53,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:54:53,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:54:53,927 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_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/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_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN 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 -> c64c4370fd8b6e918e28e5e9f3a24e52a6875ae7268f4c7e3f97f19ee293047c [2022-11-20 10:54:54,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:54:54,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:54:54,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:54:54,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:54:54,298 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:54:54,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-15/array17_alloca.i [2022-11-20 10:54:57,254 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:54:57,575 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:54:57,576 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/sv-benchmarks/c/termination-15/array17_alloca.i [2022-11-20 10:54:57,588 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/data/0765d0d46/28f352f02a9b44f9b991161f51828d92/FLAG581d161f9 [2022-11-20 10:54:57,606 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/data/0765d0d46/28f352f02a9b44f9b991161f51828d92 [2022-11-20 10:54:57,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:54:57,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:54:57,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:54:57,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:54:57,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:54:57,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:54:57" (1/1) ... [2022-11-20 10:54:57,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbc5f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:57, skipping insertion in model container [2022-11-20 10:54:57,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:54:57" (1/1) ... [2022-11-20 10:54:57,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:54:57,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:54:58,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:54:58,065 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:54:58,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:54:58,150 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:54:58,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58 WrapperNode [2022-11-20 10:54:58,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:54:58,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:54:58,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:54:58,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:54:58,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,196 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2022-11-20 10:54:58,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:54:58,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:54:58,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:54:58,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:54:58,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:54:58,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:54:58,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:54:58,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:54:58,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (1/1) ... [2022-11-20 10:54:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:54:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:54:58,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:54:58,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:54:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:54:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:54:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:54:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:54:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:54:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:54:58,396 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:54:58,398 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:54:58,562 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:54:58,567 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:54:58,567 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:54:58,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:54:58 BoogieIcfgContainer [2022-11-20 10:54:58,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:54:58,570 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:54:58,570 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:54:58,574 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:54:58,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:54:58,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:54:57" (1/3) ... [2022-11-20 10:54:58,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135b6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:54:58, skipping insertion in model container [2022-11-20 10:54:58,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:54:58,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:54:58" (2/3) ... [2022-11-20 10:54:58,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135b6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:54:58, skipping insertion in model container [2022-11-20 10:54:58,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:54:58,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:54:58" (3/3) ... [2022-11-20 10:54:58,595 INFO L332 chiAutomizerObserver]: Analyzing ICFG array17_alloca.i [2022-11-20 10:54:58,690 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:54:58,703 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:54:58,703 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:54:58,703 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:54:58,703 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:54:58,704 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:54:58,704 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:54:58,704 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:54:58,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:58,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-20 10:54:58,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:54:58,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:54:58,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:54:58,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:54:58,761 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:54:58,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:54:58,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-20 10:54:58,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:54:58,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:54:58,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:54:58,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:54:58,780 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 13#L367true assume !(main_~length~0#1 < 1); 11#L367-2true assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 14#L371true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 16#L373true assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 4#L375-3true [2022-11-20 10:54:58,781 INFO L750 eck$LassoCheckResult]: Loop: 4#L375-3true assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 9#L375-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4#L375-3true [2022-11-20 10:54:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2022-11-20 10:54:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601439065] [2022-11-20 10:54:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:58,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:58,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:54:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:59,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:54:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-11-20 10:54:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:59,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514727139] [2022-11-20 10:54:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:59,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:54:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:59,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:54:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:54:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 180522064, now seen corresponding path program 1 times [2022-11-20 10:54:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:54:59,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266347373] [2022-11-20 10:54:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:54:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:54:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:59,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:54:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:54:59,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:54:59,537 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:54:59,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:54:59,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:54:59,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:54:59,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:54:59,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:54:59,539 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:54:59,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:54:59,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration1_Lasso [2022-11-20 10:54:59,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:54:59,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:54:59,608 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,659 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,666 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,671 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,674 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,677 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,687 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,690 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,695 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:54:59,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:00,214 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:55:00,218 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:55:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-20 10:55:00,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 10:55:00,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:00,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:00,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-20 10:55:00,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-20 10:55:00,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-20 10:55:00,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-20 10:55:00,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-20 10:55:00,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-20 10:55:00,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-20 10:55:00,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-20 10:55:00,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-20 10:55:00,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:00,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:00,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,702 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,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-11-20 10:55:00,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-20 10:55:00,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:00,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:00,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:00,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,750 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-20 10:55:00,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:00,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:00,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:00,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:00,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:00,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:00,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:00,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:00,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:00,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:00,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:00,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-20 10:55:00,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:00,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:00,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:55:00,953 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-11-20 10:55:00,953 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-11-20 10:55:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:01,029 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:01,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:55:01,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-20 10:55:01,048 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-20 10:55:01,049 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:55:01,049 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2022-11-20 10:55:01,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:01,080 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-11-20 10:55:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:01,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:55:01,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:01,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:55:01,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:01,325 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-11-20 10:55:01,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 10:55:01,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 37 states and 51 transitions. Complement of second has 8 states. [2022-11-20 10:55:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 10:55:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 10:55:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-11-20 10:55:01,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-20 10:55:01,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:01,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-20 10:55:01,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:01,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 4 letters. [2022-11-20 10:55:01,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:01,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 51 transitions. [2022-11-20 10:55:01,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:01,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 12 states and 16 transitions. [2022-11-20 10:55:01,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-11-20 10:55:01,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-20 10:55:01,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-11-20 10:55:01,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:01,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-20 10:55:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-11-20 10:55:01,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-20 10:55:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-20 10:55:01,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-20 10:55:01,519 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-20 10:55:01,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:55:01,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-11-20 10:55:01,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:01,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:01,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:01,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:01,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:01,525 INFO L748 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 136#L367 assume !(main_~length~0#1 < 1); 133#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 134#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 135#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 129#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 130#L375-4 main_~j~0#1 := 1; 125#L380-2 [2022-11-20 10:55:01,525 INFO L750 eck$LassoCheckResult]: Loop: 125#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 126#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 125#L380-2 [2022-11-20 10:55:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 180522006, now seen corresponding path program 1 times [2022-11-20 10:55:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127777393] [2022-11-20 10:55:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:01,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:01,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127777393] [2022-11-20 10:55:01,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127777393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:01,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:01,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:55:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800451589] [2022-11-20 10:55:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:01,647 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 1 times [2022-11-20 10:55:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635778757] [2022-11-20 10:55:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:55:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:55:01,779 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 10:55:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:01,820 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-11-20 10:55:01,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2022-11-20 10:55:01,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:01,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2022-11-20 10:55:01,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-20 10:55:01,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-20 10:55:01,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-11-20 10:55:01,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:01,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-11-20 10:55:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-11-20 10:55:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-20 10:55:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-11-20 10:55:01,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-11-20 10:55:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:55:01,836 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-11-20 10:55:01,836 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:55:01,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-11-20 10:55:01,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:01,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:01,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:01,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:01,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:01,842 INFO L748 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 160#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 167#L367 assume !(main_~length~0#1 < 1); 161#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 162#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 168#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 163#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 164#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 165#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 166#L375-4 main_~j~0#1 := 1; 157#L380-2 [2022-11-20 10:55:01,842 INFO L750 eck$LassoCheckResult]: Loop: 157#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 158#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 157#L380-2 [2022-11-20 10:55:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1683012600, now seen corresponding path program 1 times [2022-11-20 10:55:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189317536] [2022-11-20 10:55:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 2 times [2022-11-20 10:55:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853816861] [2022-11-20 10:55:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:01,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1827560517, now seen corresponding path program 1 times [2022-11-20 10:55:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:01,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228269140] [2022-11-20 10:55:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:02,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228269140] [2022-11-20 10:55:02,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228269140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:02,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927836221] [2022-11-20 10:55:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:02,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:02,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:55:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:02,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:55:02,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:02,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:02,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927836221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:02,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-20 10:55:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585352456] [2022-11-20 10:55:02,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:02,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:02,280 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:02,351 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-11-20 10:55:02,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2022-11-20 10:55:02,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:02,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 15 states and 17 transitions. [2022-11-20 10:55:02,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-20 10:55:02,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-20 10:55:02,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2022-11-20 10:55:02,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:55:02,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-20 10:55:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2022-11-20 10:55:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-11-20 10:55:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-11-20 10:55:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-20 10:55:02,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 10:55:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:55:02,357 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-20 10:55:02,357 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:55:02,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-11-20 10:55:02,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:02,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:02,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:02,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:02,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:02,359 INFO L748 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 286#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 289#L367 assume !(main_~length~0#1 < 1); 287#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 288#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 290#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 281#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 282#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 283#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 284#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 292#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 291#L375-4 main_~j~0#1 := 1; 279#L380-2 [2022-11-20 10:55:02,359 INFO L750 eck$LassoCheckResult]: Loop: 279#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 280#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 279#L380-2 [2022-11-20 10:55:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1827505318, now seen corresponding path program 2 times [2022-11-20 10:55:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:02,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349613651] [2022-11-20 10:55:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 3 times [2022-11-20 10:55:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:02,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540654250] [2022-11-20 10:55:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 409014941, now seen corresponding path program 2 times [2022-11-20 10:55:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622259233] [2022-11-20 10:55:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:02,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:02,897 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:55:02,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:55:02,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:55:02,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:55:02,897 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:55:02,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:02,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:55:02,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:55:02,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: array17_alloca.i_Iteration4_Lasso [2022-11-20 10:55:02,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:55:02,898 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:55:02,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:02,903 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:02,905 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:02,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:02,911 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,232 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,235 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,237 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,240 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,243 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,246 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:55:03,556 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:55:03,556 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:55:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,563 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:03,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:03,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:03,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-20 10:55:03,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,608 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:03,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:03,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:03,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-20 10:55:03,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,656 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-20 10:55:03,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:03,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:03,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,712 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:55:03,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:55:03,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:55:03,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-20 10:55:03,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,745 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-20 10:55:03,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:03,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:03,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,798 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-20 10:55:03,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:03,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:03,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:55:03,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,849 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:55:03,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-20 10:55:03,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:55:03,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:55:03,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:55:03,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:55:03,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:55:03,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:55:03,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:55:03,919 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-11-20 10:55:03,919 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-11-20 10:55:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:55:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:03,927 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:03,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:55:03,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-20 10:55:03,964 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-20 10:55:03,964 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:55:03,964 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-11-20 10:55:03,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:03,988 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-11-20 10:55:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:04,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:55:04,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:04,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:55:04,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:04,066 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-20 10:55:04,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:04,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 22 transitions. Complement of second has 5 states. [2022-11-20 10:55:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-20 10:55:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-11-20 10:55:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2022-11-20 10:55:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2022-11-20 10:55:04,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 4 letters. [2022-11-20 10:55:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:55:04,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2022-11-20 10:55:04,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:04,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2022-11-20 10:55:04,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-20 10:55:04,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-20 10:55:04,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2022-11-20 10:55:04,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:04,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-20 10:55:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2022-11-20 10:55:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 10:55:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-20 10:55:04,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-20 10:55:04,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-20 10:55:04,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 10:55:04,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2022-11-20 10:55:04,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:04,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:04,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:04,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:04,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:04,088 INFO L748 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 406#L367 assume !(main_~length~0#1 < 1); 400#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 401#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 407#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 402#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 403#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 404#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 405#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 410#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 408#L375-4 main_~j~0#1 := 1; 409#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 397#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 393#L380-2 [2022-11-20 10:55:04,088 INFO L750 eck$LassoCheckResult]: Loop: 393#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 394#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 393#L380-2 [2022-11-20 10:55:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash 409014943, now seen corresponding path program 1 times [2022-11-20 10:55:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593159595] [2022-11-20 10:55:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:04,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-20 10:55:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593159595] [2022-11-20 10:55:04,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593159595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:04,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054373419] [2022-11-20 10:55:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:04,683 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:04,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 10:55:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:04,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 10:55:04,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:04,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:55:04,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:04,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:55:05,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:05,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:05,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:05,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:05,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2022-11-20 10:55:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:05,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:17,234 WARN L233 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:55:34,553 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 50 treesize of output 46 [2022-11-20 10:55:34,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:34,586 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 1290 treesize of output 1082 [2022-11-20 10:55:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054373419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:35,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-11-20 10:55:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536257496] [2022-11-20 10:55:35,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:35,398 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 4 times [2022-11-20 10:55:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:35,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414176309] [2022-11-20 10:55:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:35,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:35,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:55:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=216, Unknown=1, NotChecked=0, Total=272 [2022-11-20 10:55:35,496 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,641 WARN L233 SmtUtils]: Spent 12.04s 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-11-20 10:55:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:47,788 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-11-20 10:55:47,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2022-11-20 10:55:47,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-11-20 10:55:47,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 41 transitions. [2022-11-20 10:55:47,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-20 10:55:47,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-20 10:55:47,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-11-20 10:55:47,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:47,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-11-20 10:55:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-11-20 10:55:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-11-20 10:55:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-11-20 10:55:47,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-11-20 10:55:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:55:47,796 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-11-20 10:55:47,796 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 10:55:47,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2022-11-20 10:55:47,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:47,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:47,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:47,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:47,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:47,798 INFO L748 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 568#L367 assume !(main_~length~0#1 < 1); 558#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 559#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 567#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 560#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 561#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 562#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 563#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 570#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 569#L375-4 main_~j~0#1 := 1; 554#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 555#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 556#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 557#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 566#L380-2 [2022-11-20 10:55:47,798 INFO L750 eck$LassoCheckResult]: Loop: 566#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 573#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 566#L380-2 [2022-11-20 10:55:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2073631454, now seen corresponding path program 1 times [2022-11-20 10:55:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:47,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109448305] [2022-11-20 10:55:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:47,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109448305] [2022-11-20 10:55:47,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109448305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:47,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94467751] [2022-11-20 10:55:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:47,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:47,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:47,924 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:47,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 10:55:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:47,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:55:47,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:48,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:48,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94467751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:48,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:48,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-20 10:55:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250729104] [2022-11-20 10:55:48,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:48,144 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:48,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 5 times [2022-11-20 10:55:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:48,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773963321] [2022-11-20 10:55:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:48,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:48,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:55:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:55:48,253 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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-11-20 10:55:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:48,345 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-11-20 10:55:48,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2022-11-20 10:55:48,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:48,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 29 transitions. [2022-11-20 10:55:48,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-20 10:55:48,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-20 10:55:48,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2022-11-20 10:55:48,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:48,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-20 10:55:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2022-11-20 10:55:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 10:55:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-20 10:55:48,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-20 10:55:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:55:48,349 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-20 10:55:48,349 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 10:55:48,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2022-11-20 10:55:48,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:48,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:48,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:48,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:48,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:48,351 INFO L748 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 730#L367 assume !(main_~length~0#1 < 1); 728#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 729#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 731#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 722#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 723#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 724#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 725#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 740#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 739#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 736#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 735#L375-4 main_~j~0#1 := 1; 734#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 720#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 719#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 721#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 717#L380-2 [2022-11-20 10:55:48,351 INFO L750 eck$LassoCheckResult]: Loop: 717#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 718#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 717#L380-2 [2022-11-20 10:55:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash -457174268, now seen corresponding path program 2 times [2022-11-20 10:55:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:48,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862324095] [2022-11-20 10:55:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:48,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:48,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862324095] [2022-11-20 10:55:48,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862324095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:48,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833162257] [2022-11-20 10:55:48,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:55:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:48,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:48,851 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:48,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 10:55:48,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:55:48,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:48,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:55:48,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:49,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:55:49,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:55:49,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:49,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:49,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:49,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:49,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:49,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2022-11-20 10:55:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:49,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:49,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-20 10:55:49,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:49,708 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 526 treesize of output 462 [2022-11-20 10:55:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:50,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833162257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:50,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:50,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2022-11-20 10:55:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778410409] [2022-11-20 10:55:50,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:50,013 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 6 times [2022-11-20 10:55:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963432792] [2022-11-20 10:55:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:55:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:55:50,156 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:50,553 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-11-20 10:55:50,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2022-11-20 10:55:50,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-20 10:55:50,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 49 states and 61 transitions. [2022-11-20 10:55:50,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-11-20 10:55:50,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-11-20 10:55:50,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 61 transitions. [2022-11-20 10:55:50,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:50,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-11-20 10:55:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 61 transitions. [2022-11-20 10:55:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-11-20 10:55:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-20 10:55:50,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-20 10:55:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:55:50,561 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-20 10:55:50,561 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 10:55:50,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2022-11-20 10:55:50,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:50,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:50,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:50,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:50,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:50,563 INFO L748 eck$LassoCheckResult]: Stem: 943#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 949#L367 assume !(main_~length~0#1 < 1); 945#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 946#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 950#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 939#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 940#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 956#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 957#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 941#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 942#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 965#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 963#L375-4 main_~j~0#1 := 1; 958#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 959#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 937#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 938#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 948#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 947#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 935#L380-2 [2022-11-20 10:55:50,563 INFO L750 eck$LassoCheckResult]: Loop: 935#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 936#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 935#L380-2 [2022-11-20 10:55:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1257807801, now seen corresponding path program 3 times [2022-11-20 10:55:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380284601] [2022-11-20 10:55:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:50,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380284601] [2022-11-20 10:55:50,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380284601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:50,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564435416] [2022-11-20 10:55:50,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:55:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:50,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:50,691 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:50,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 10:55:50,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 10:55:50,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:50,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:55:50,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:50,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:50,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564435416] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:50,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:50,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-11-20 10:55:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572733269] [2022-11-20 10:55:50,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:50,954 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 7 times [2022-11-20 10:55:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673605974] [2022-11-20 10:55:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:55:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:55:51,059 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:51,192 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-20 10:55:51,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2022-11-20 10:55:51,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:51,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 40 transitions. [2022-11-20 10:55:51,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-20 10:55:51,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-20 10:55:51,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2022-11-20 10:55:51,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:51,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-20 10:55:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2022-11-20 10:55:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-20 10:55:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-20 10:55:51,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-20 10:55:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:55:51,200 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-20 10:55:51,200 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 10:55:51,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2022-11-20 10:55:51,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:51,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:51,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:51,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:51,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:51,202 INFO L748 eck$LassoCheckResult]: Stem: 1152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1162#L367 assume !(main_~length~0#1 < 1); 1154#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1155#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1163#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1156#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1157#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1158#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1159#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1166#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1172#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1171#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1170#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1168#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1164#L375-4 main_~j~0#1 := 1; 1165#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1167#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1178#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1176#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1148#L380-2 [2022-11-20 10:55:51,202 INFO L750 eck$LassoCheckResult]: Loop: 1148#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1149#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1148#L380-2 [2022-11-20 10:55:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1819977752, now seen corresponding path program 2 times [2022-11-20 10:55:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774319637] [2022-11-20 10:55:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:55:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:51,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774319637] [2022-11-20 10:55:51,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774319637] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:51,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883919977] [2022-11-20 10:55:51,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:55:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:51,298 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:51,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 10:55:51,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:55:51,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:51,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:55:51,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:55:51,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:55:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883919977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:51,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:55:51,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-20 10:55:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282695247] [2022-11-20 10:55:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:51,393 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 8 times [2022-11-20 10:55:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302222423] [2022-11-20 10:55:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:55:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:55:51,508 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:51,530 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-11-20 10:55:51,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2022-11-20 10:55:51,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:51,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 29 states and 33 transitions. [2022-11-20 10:55:51,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-20 10:55:51,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-20 10:55:51,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2022-11-20 10:55:51,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:51,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-20 10:55:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2022-11-20 10:55:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-11-20 10:55:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-20 10:55:51,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-20 10:55:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:55:51,538 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-20 10:55:51,538 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 10:55:51,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2022-11-20 10:55:51,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:55:51,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:51,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:51,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:51,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:55:51,542 INFO L748 eck$LassoCheckResult]: Stem: 1282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1293#L367 assume !(main_~length~0#1 < 1); 1284#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1285#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1294#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1286#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1287#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1288#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1289#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1306#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1305#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1304#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1303#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1300#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1299#L375-4 main_~j~0#1 := 1; 1298#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1297#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1281#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1280#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1292#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1290#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1291#L380-2 [2022-11-20 10:55:51,543 INFO L750 eck$LassoCheckResult]: Loop: 1291#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1296#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1291#L380-2 [2022-11-20 10:55:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -948777687, now seen corresponding path program 4 times [2022-11-20 10:55:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136679593] [2022-11-20 10:55:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136679593] [2022-11-20 10:55:52,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136679593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:52,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991866240] [2022-11-20 10:55:52,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:55:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:52,175 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:52,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 10:55:52,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:55:52,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:52,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 10:55:52,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:52,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:55:52,436 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-20 10:55:52,436 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 29 treesize of output 36 [2022-11-20 10:55:53,132 INFO L321 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-11-20 10:55:53,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 36 [2022-11-20 10:55:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:53,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:05,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_85| Int)) (or (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_85| 4))) (< (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset| (- 4))) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~arr~0#1.offset|)))) (not (< |v_ULTIMATE.start_main_~j~0#1_85| |c_ULTIMATE.start_main_~length~0#1|)) (< |v_ULTIMATE.start_main_~j~0#1_85| 3))) is different from false [2022-11-20 10:56:47,381 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 48 treesize of output 44 [2022-11-20 10:56:47,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:56:47,394 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 614 treesize of output 524 [2022-11-20 10:56:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 10:56:47,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991866240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:56:47,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:56:47,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-11-20 10:56:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096796596] [2022-11-20 10:56:47,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:56:47,658 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:56:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:56:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 9 times [2022-11-20 10:56:47,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:56:47,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757658368] [2022-11-20 10:56:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:56:47,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:56:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:47,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:56:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:56:47,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:56:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:56:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 10:56:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=775, Unknown=2, NotChecked=58, Total=992 [2022-11-20 10:56:47,754 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:01,719 WARN L233 SmtUtils]: Spent 13.58s on a formula simplification. DAG size of input: 50 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:57:14,838 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:57:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:14,911 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-11-20 10:57:14,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2022-11-20 10:57:14,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:57:14,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 27 transitions. [2022-11-20 10:57:14,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-20 10:57:14,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-20 10:57:14,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2022-11-20 10:57:14,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:57:14,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-20 10:57:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2022-11-20 10:57:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 10:57:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-20 10:57:14,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-20 10:57:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:57:14,916 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-20 10:57:14,917 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 10:57:14,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-11-20 10:57:14,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:57:14,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:57:14,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:57:14,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:14,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:57:14,919 INFO L748 eck$LassoCheckResult]: Stem: 1532#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1533#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1537#L367 assume !(main_~length~0#1 < 1); 1534#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1535#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1536#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1528#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1529#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1530#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1531#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1546#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1545#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1544#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1543#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1542#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1541#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1540#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1538#L375-4 main_~j~0#1 := 1; 1539#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1526#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1525#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1527#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1523#L380-2 [2022-11-20 10:57:14,919 INFO L750 eck$LassoCheckResult]: Loop: 1523#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1524#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1523#L380-2 [2022-11-20 10:57:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1510949560, now seen corresponding path program 5 times [2022-11-20 10:57:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419169273] [2022-11-20 10:57:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419169273] [2022-11-20 10:57:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419169273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660753049] [2022-11-20 10:57:15,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:57:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:15,615 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:15,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-20 10:57:15,715 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-20 10:57:15,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:57:15,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 10:57:15,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:15,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:57:15,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-11-20 10:57:16,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:57:16,122 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 1 case distinctions, treesize of input 39 treesize of output 41 [2022-11-20 10:57:16,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:57:16,195 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 1 case distinctions, treesize of input 39 treesize of output 41 [2022-11-20 10:57:16,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:57:16,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:57:16,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:57:16,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 18 [2022-11-20 10:57:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:16,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:17,549 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 77 treesize of output 73 [2022-11-20 10:57:17,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:57:17,561 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 1087 treesize of output 1023 [2022-11-20 10:57:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:17,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660753049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:57:17,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:57:17,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 34 [2022-11-20 10:57:17,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879196374] [2022-11-20 10:57:17,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:57:17,943 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:57:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 10 times [2022-11-20 10:57:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:17,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703657145] [2022-11-20 10:57:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:57:17,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:57:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:57:17,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:57:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 10:57:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 10:57:18,042 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:18,981 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-20 10:57:18,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2022-11-20 10:57:18,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:57:18,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 44 transitions. [2022-11-20 10:57:18,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-20 10:57:18,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-20 10:57:18,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2022-11-20 10:57:18,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:57:18,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-20 10:57:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2022-11-20 10:57:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-11-20 10:57:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-20 10:57:18,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-20 10:57:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:57:18,992 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-20 10:57:18,992 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-20 10:57:18,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2022-11-20 10:57:18,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:57:18,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:57:18,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:57:18,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:18,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:57:18,994 INFO L748 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1772#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1778#L367 assume !(main_~length~0#1 < 1); 1773#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1774#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 1779#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 1767#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1768#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1769#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1770#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1799#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1798#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1797#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1796#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1795#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 1794#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1787#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 1784#L375-4 main_~j~0#1 := 1; 1783#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1782#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1766#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1765#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1777#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1775#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 1776#L380-2 [2022-11-20 10:57:18,994 INFO L750 eck$LassoCheckResult]: Loop: 1776#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 1781#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1776#L380-2 [2022-11-20 10:57:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -323581557, now seen corresponding path program 6 times [2022-11-20 10:57:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:18,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364217569] [2022-11-20 10:57:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364217569] [2022-11-20 10:57:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364217569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340098456] [2022-11-20 10:57:19,623 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:57:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:19,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:19,630 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:19,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-20 10:57:19,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-20 10:57:19,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:57:19,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:57:19,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:19,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:57:19,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-20 10:57:20,089 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-20 10:57:20,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2022-11-20 10:57:20,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:57:20,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:57:20,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:57:20,849 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-20 10:57:20,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 45 [2022-11-20 10:57:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:20,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:57:59,305 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 65 treesize of output 61 [2022-11-20 10:57:59,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:57:59,342 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 34874 treesize of output 31290 [2022-11-20 10:58:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340098456] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:58:14,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:58:14,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 37 [2022-11-20 10:58:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111834300] [2022-11-20 10:58:14,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:58:14,435 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:58:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 11 times [2022-11-20 10:58:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:14,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746902124] [2022-11-20 10:58:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:14,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:14,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 10:58:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1230, Unknown=1, NotChecked=0, Total=1406 [2022-11-20 10:58:14,537 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 10 Second operand has 38 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:26,854 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 54 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:58:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:27,500 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-11-20 10:58:27,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2022-11-20 10:58:27,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:58:27,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 56 transitions. [2022-11-20 10:58:27,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-20 10:58:27,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-20 10:58:27,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 56 transitions. [2022-11-20 10:58:27,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:58:27,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-20 10:58:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 56 transitions. [2022-11-20 10:58:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-11-20 10:58:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.175) internal successors, (47), 39 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-11-20 10:58:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-20 10:58:27,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-20 10:58:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:58:27,518 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-20 10:58:27,518 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-20 10:58:27,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2022-11-20 10:58:27,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:58:27,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:58:27,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:58:27,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:27,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:58:27,521 INFO L748 eck$LassoCheckResult]: Stem: 2049#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2060#L367 assume !(main_~length~0#1 < 1); 2051#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2052#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2061#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2053#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2054#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2055#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2056#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2063#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2083#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2082#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2081#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2080#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2079#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2078#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2076#L375-4 main_~j~0#1 := 1; 2085#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2084#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2048#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2047#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2059#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2065#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2064#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2057#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2058#L380-2 [2022-11-20 10:58:27,521 INFO L750 eck$LassoCheckResult]: Loop: 2058#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2066#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2058#L380-2 [2022-11-20 10:58:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1724231410, now seen corresponding path program 7 times [2022-11-20 10:58:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:27,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518922280] [2022-11-20 10:58:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:28,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518922280] [2022-11-20 10:58:28,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518922280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:28,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286176709] [2022-11-20 10:58:28,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 10:58:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:28,111 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:28,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-20 10:58:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:28,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 10:58:28,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:28,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:58:28,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 10:58:28,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:58:28,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:58:28,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:28,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2022-11-20 10:58:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:28,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:58:29,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-20 10:58:29,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:29,374 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 256 treesize of output 224 [2022-11-20 10:58:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:29,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286176709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:58:29,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:58:29,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 31 [2022-11-20 10:58:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392481089] [2022-11-20 10:58:29,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:58:29,455 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:58:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 12 times [2022-11-20 10:58:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:29,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392221890] [2022-11-20 10:58:29,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:29,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:29,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 10:58:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2022-11-20 10:58:29,563 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 10 Second operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:30,232 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-11-20 10:58:30,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2022-11-20 10:58:30,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2022-11-20 10:58:30,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 64 states and 75 transitions. [2022-11-20 10:58:30,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-11-20 10:58:30,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-11-20 10:58:30,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 75 transitions. [2022-11-20 10:58:30,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:58:30,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-11-20 10:58:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 75 transitions. [2022-11-20 10:58:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2022-11-20 10:58:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-11-20 10:58:30,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-11-20 10:58:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:58:30,239 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-11-20 10:58:30,240 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-20 10:58:30,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2022-11-20 10:58:30,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:58:30,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:58:30,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:58:30,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:30,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:58:30,242 INFO L748 eck$LassoCheckResult]: Stem: 2359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2366#L367 assume !(main_~length~0#1 < 1); 2361#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2362#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2367#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2355#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2356#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2369#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2375#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2379#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2378#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2377#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2376#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2357#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2358#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2370#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2368#L375-4 main_~j~0#1 := 1; 2351#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2352#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2353#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2354#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2365#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2391#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2380#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2374#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2373#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2363#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2364#L380-2 [2022-11-20 10:58:30,242 INFO L750 eck$LassoCheckResult]: Loop: 2364#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2372#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2364#L380-2 [2022-11-20 10:58:30,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:30,243 INFO L85 PathProgramCache]: Analyzing trace with hash 870990801, now seen corresponding path program 8 times [2022-11-20 10:58:30,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:30,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521342442] [2022-11-20 10:58:30,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:30,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:30,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521342442] [2022-11-20 10:58:30,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521342442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:30,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105248960] [2022-11-20 10:58:30,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:58:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:30,511 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:30,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-20 10:58:30,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:58:30,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:30,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:58:30,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:30,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:58:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:30,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105248960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:58:30,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:58:30,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2022-11-20 10:58:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329403860] [2022-11-20 10:58:30,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:58:30,941 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:58:30,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2436, now seen corresponding path program 13 times [2022-11-20 10:58:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:30,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40547284] [2022-11-20 10:58:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:30,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:30,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 10:58:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:58:31,053 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:31,234 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-20 10:58:31,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 58 transitions. [2022-11-20 10:58:31,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:58:31,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 42 states and 48 transitions. [2022-11-20 10:58:31,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-11-20 10:58:31,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-11-20 10:58:31,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2022-11-20 10:58:31,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:58:31,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-20 10:58:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2022-11-20 10:58:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-20 10:58:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-20 10:58:31,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-20 10:58:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:58:31,244 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-20 10:58:31,244 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-20 10:58:31,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2022-11-20 10:58:31,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-11-20 10:58:31,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:58:31,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:58:31,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:31,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:58:31,249 INFO L748 eck$LassoCheckResult]: Stem: 2651#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet207#1, main_#t~post209#1, main_#t~post208#1, main_#t~mem210#1, main_#t~mem211#1, main_#t~post212#1, main_#t~post213#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~value~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2658#L367 assume !(main_~length~0#1 < 1); 2653#L367-2 assume !!(main_~length~0#1 <= 536870911);call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2654#L371 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~value~0#1 := main_#t~nondet207#1;havoc main_#t~nondet207#1; 2659#L373 assume !!(main_~value~0#1 <= 1073741823);main_~i~0#1 := 0; 2647#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2648#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2649#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2650#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2661#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2684#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2683#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2682#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2681#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2680#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2679#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2678#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2677#L375-3 assume !!(main_~i~0#1 < main_~length~0#1);main_#t~post209#1 := main_~value~0#1;main_~value~0#1 := 1 + main_#t~post209#1;call write~int(main_#t~post209#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~post209#1; 2676#L375-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2673#L375-3 assume !(main_~i~0#1 < main_~length~0#1); 2672#L375-4 main_~j~0#1 := 1; 2669#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2667#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2665#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2664#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2663#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2655#L380 assume !(main_#t~mem210#1 > main_#t~mem211#1);havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post213#1 := main_~j~0#1;main_~j~0#1 := main_#t~post213#1 - 1;havoc main_#t~post213#1; 2656#L380-2 [2022-11-20 10:58:31,249 INFO L750 eck$LassoCheckResult]: Loop: 2656#L380-2 assume !!(0 < main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);call main_#t~mem211#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~j~0#1 - 1), 4); 2662#L380 assume main_#t~mem210#1 > main_#t~mem211#1;havoc main_#t~mem210#1;havoc main_#t~mem211#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2656#L380-2 [2022-11-20 10:58:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash -93884209, now seen corresponding path program 9 times [2022-11-20 10:58:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:31,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738355671] [2022-11-20 10:58:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:32,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:32,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738355671] [2022-11-20 10:58:32,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738355671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:58:32,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610865167] [2022-11-20 10:58:32,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:58:32,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:58:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:32,615 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:58:32,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6562457-cc05-4868-a435-2a0ef563152b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-20 10:58:32,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 10:58:32,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:32,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 10:58:32,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:32,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:58:32,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:32,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-20 10:58:32,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:32,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:32,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:32,948 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 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-20 10:58:32,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:32,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:32,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:32,996 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 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-20 10:58:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:33,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:58:33,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:33,076 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 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-20 10:58:33,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:58:33,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 12 [2022-11-20 10:58:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:33,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:59:27,644 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_116| Int) (v_ArrVal_307 Int) (v_ArrVal_305 Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_131| 1)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_116|)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_305) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_116| 4)) v_ArrVal_307)) (.cse1 (* |v_ULTIMATE.start_main_~j~0#1_131| 4))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 4)) (select .cse0 (+ |c_ULTIMATE.start_main_~arr~0#1.offset| .cse1 8)))) (< |v_ULTIMATE.start_main_~i~0#1_116| (+ |v_ULTIMATE.start_main_~j~0#1_131| 2)) (not (< 0 |v_ULTIMATE.start_main_~j~0#1_131|)))) is different from false [2022-11-20 11:05:48,198 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 79 treesize of output 75 [2022-11-20 11:05:48,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:05:48,252 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 163834 treesize of output 156666