./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8393723b 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_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro --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 e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- 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-8393723 [2022-11-18 20:08:13,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:08:13,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:08:13,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:08:13,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:08:13,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:08:13,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:08:13,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:08:13,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:08:13,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:08:13,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:08:13,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:08:13,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:08:13,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:08:13,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:08:13,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:08:13,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:08:13,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:08:13,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:08:13,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:08:13,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:08:13,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:08:13,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:08:13,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:08:13,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:08:13,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:08:13,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:08:13,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:08:13,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:08:13,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:08:13,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:08:13,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:08:13,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:08:13,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:08:13,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:08:13,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:08:13,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:08:13,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:08:13,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:08:13,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:08:13,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:08:13,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-18 20:08:13,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:08:13,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:08:13,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:08:13,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:08:13,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:08:13,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:08:13,861 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:08:13,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-18 20:08:13,862 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-18 20:08:13,862 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-18 20:08:13,863 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-18 20:08:13,863 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-18 20:08:13,864 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-18 20:08:13,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:08:13,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:08:13,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:08:13,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:08:13,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-18 20:08:13,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-18 20:08:13,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-18 20:08:13,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:08:13,866 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-18 20:08:13,866 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:08:13,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-18 20:08:13,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:08:13,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:08:13,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:08:13,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:08:13,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-18 20:08:13,869 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_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/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_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro 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 -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2022-11-18 20:08:14,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:08:14,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:08:14,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:08:14,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:08:14,204 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:08:14,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-18 20:08:14,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/data/58d0540a4/2ede504d904d48f282d6b8c335dcc431/FLAGe3f6c3ba5 [2022-11-18 20:08:14,843 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:08:14,844 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-18 20:08:14,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/data/58d0540a4/2ede504d904d48f282d6b8c335dcc431/FLAGe3f6c3ba5 [2022-11-18 20:08:15,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/data/58d0540a4/2ede504d904d48f282d6b8c335dcc431 [2022-11-18 20:08:15,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:08:15,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:08:15,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:15,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:08:15,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:08:15,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0d8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15, skipping insertion in model container [2022-11-18 20:08:15,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:08:15,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:08:15,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:15,593 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:08:15,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:15,702 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:08:15,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15 WrapperNode [2022-11-18 20:08:15,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:15,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:15,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:08:15,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:08:15,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,769 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-11-18 20:08:15,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:15,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:08:15,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:08:15,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:08:15,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:08:15,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:08:15,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:08:15,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:08:15,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (1/1) ... [2022-11-18 20:08:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:08:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:15,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:08:15,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-18 20:08:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:08:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:08:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:08:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:08:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:08:15,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:08:16,002 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:08:16,004 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:08:16,145 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:08:16,151 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:08:16,151 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:08:16,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:16 BoogieIcfgContainer [2022-11-18 20:08:16,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:08:16,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-18 20:08:16,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-18 20:08:16,163 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-18 20:08:16,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:08:16,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:08:15" (1/3) ... [2022-11-18 20:08:16,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45e05818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:08:16, skipping insertion in model container [2022-11-18 20:08:16,166 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:08:16,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:15" (2/3) ... [2022-11-18 20:08:16,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45e05818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:08:16, skipping insertion in model container [2022-11-18 20:08:16,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:08:16,167 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:16" (3/3) ... [2022-11-18 20:08:16,168 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-11-18 20:08:16,249 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-18 20:08:16,249 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-18 20:08:16,249 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-18 20:08:16,249 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-18 20:08:16,249 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-18 20:08:16,250 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-18 20:08:16,250 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-18 20:08:16,250 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-18 20:08:16,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) 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-18 20:08:16,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-18 20:08:16,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:08:16,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:08:16,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:08:16,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-18 20:08:16,309 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-18 20:08:16,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) 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-18 20:08:16,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-18 20:08:16,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:08:16,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:08:16,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:08:16,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-18 20:08:16,320 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 5#L552-4true [2022-11-18 20:08:16,321 INFO L750 eck$LassoCheckResult]: Loop: 5#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 11#L553-4true assume !true; 4#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 5#L552-4true [2022-11-18 20:08:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-18 20:08:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674632865] [2022-11-18 20:08:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:16,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:08:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:16,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:08:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-11-18 20:08:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:16,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453728807] [2022-11-18 20:08:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:16,605 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-18 20:08:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453728807] [2022-11-18 20:08:16,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453728807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:16,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:16,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:08:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431159780] [2022-11-18 20:08:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:16,613 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:08:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:08:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:08:16,656 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:16,664 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-18 20:08:16,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-11-18 20:08:16,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-18 20:08:16,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-11-18 20:08:16,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-18 20:08:16,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-11-18 20:08:16,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-11-18 20:08:16,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:08:16,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-18 20:08:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-11-18 20:08:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-18 20:08:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-18 20:08:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-18 20:08:16,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-18 20:08:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:08:16,709 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-18 20:08:16,710 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-18 20:08:16,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-11-18 20:08:16,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-18 20:08:16,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:08:16,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:08:16,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:08:16,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-18 20:08:16,713 INFO L748 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2022-11-18 20:08:16,714 INFO L750 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2022-11-18 20:08:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-18 20:08:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:16,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594470462] [2022-11-18 20:08:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:16,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:08:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:16,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:08:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-11-18 20:08:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:16,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968355727] [2022-11-18 20:08:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:17,082 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-18 20:08:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968355727] [2022-11-18 20:08:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968355727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:17,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:08:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039183505] [2022-11-18 20:08:17,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:17,084 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:08:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:08:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:08:17,087 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-18 20:08:17,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:17,166 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-11-18 20:08:17,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-11-18 20:08:17,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-18 20:08:17,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-11-18 20:08:17,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-18 20:08:17,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-18 20:08:17,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-11-18 20:08:17,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:08:17,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-18 20:08:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-11-18 20:08:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-11-18 20:08:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 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-18 20:08:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-18 20:08:17,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-18 20:08:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:08:17,174 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-18 20:08:17,174 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-18 20:08:17,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-11-18 20:08:17,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-18 20:08:17,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:08:17,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:08:17,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:08:17,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:17,180 INFO L748 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-4 [2022-11-18 20:08:17,180 INFO L750 eck$LassoCheckResult]: Loop: 61#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 64#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 65#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 66#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 69#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 60#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 61#L552-4 [2022-11-18 20:08:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-18 20:08:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:17,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570745006] [2022-11-18 20:08:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:17,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:08:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:17,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:08:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-11-18 20:08:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221034394] [2022-11-18 20:08:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:17,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221034394] [2022-11-18 20:08:17,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221034394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872867168] [2022-11-18 20:08:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:17,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:18,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:18,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:08:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:18,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:08:18,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:18,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:08:18,332 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-18 20:08:18,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-11-18 20:08:18,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:08:18,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:08:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:18,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:18,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872867168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:18,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:18,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-18 20:08:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011811011] [2022-11-18 20:08:18,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:18,527 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:08:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:08:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:08:18,529 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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-18 20:08:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:18,640 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-18 20:08:18,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-11-18 20:08:18,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-11-18 20:08:18,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-11-18 20:08:18,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-18 20:08:18,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-18 20:08:18,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-11-18 20:08:18,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:08:18,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-18 20:08:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-11-18 20:08:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-18 20:08:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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-18 20:08:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-18 20:08:18,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-18 20:08:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:08:18,647 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-18 20:08:18,648 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-18 20:08:18,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-11-18 20:08:18,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-18 20:08:18,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:08:18,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:08:18,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:08:18,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-11-18 20:08:18,650 INFO L748 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2022-11-18 20:08:18,650 INFO L750 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 156#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 157#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 159#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 166#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 162#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 163#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 151#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 152#L552-4 [2022-11-18 20:08:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-18 20:08:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168160003] [2022-11-18 20:08:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:18,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:08:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:08:18,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:08:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-11-18 20:08:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:18,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881013191] [2022-11-18 20:08:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:21,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881013191] [2022-11-18 20:08:21,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881013191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126486624] [2022-11-18 20:08:21,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:08:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:21,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:21,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:08:21,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:08:21,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:21,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 20:08:21,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:21,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:08:21,752 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-18 20:08:21,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-11-18 20:08:21,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-18 20:08:21,998 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-18 20:08:21,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-18 20:08:22,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-18 20:08:22,221 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-18 20:08:22,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-18 20:08:22,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-18 20:08:22,467 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-18 20:08:22,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2022-11-18 20:08:22,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:08:22,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:08:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:22,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126486624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:39,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:39,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 21 [2022-11-18 20:12:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20926359] [2022-11-18 20:12:39,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:39,534 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:12:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:12:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=257, Unknown=20, NotChecked=0, Total=420 [2022-11-18 20:12:39,535 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:39,824 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-11-18 20:12:39,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-11-18 20:12:39,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-11-18 20:12:39,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2022-11-18 20:12:39,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-18 20:12:39,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-18 20:12:39,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2022-11-18 20:12:39,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:39,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-18 20:12:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2022-11-18 20:12:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-11-18 20:12:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 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-18 20:12:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-18 20:12:39,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-18 20:12:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:12:39,830 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-18 20:12:39,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-18 20:12:39,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-11-18 20:12:39,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-11-18 20:12:39,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:12:39,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:12:39,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:12:39,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2022-11-18 20:12:39,832 INFO L748 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 320#L552-4 [2022-11-18 20:12:39,832 INFO L750 eck$LassoCheckResult]: Loop: 320#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 321#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 326#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 338#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 322#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 323#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 324#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 325#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 337#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 336#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 335#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 334#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 333#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 332#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 331#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 330#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 328#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 329#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 327#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 319#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 320#L552-4 [2022-11-18 20:12:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-18 20:12:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:39,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907539129] [2022-11-18 20:12:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:12:39,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:12:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:12:39,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:12:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 3 times [2022-11-18 20:12:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:39,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578160137] [2022-11-18 20:12:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:12:39,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:12:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:12:39,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:12:39,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2022-11-18 20:12:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:39,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423213689] [2022-11-18 20:12:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423213689] [2022-11-18 20:12:41,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423213689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891671708] [2022-11-18 20:12:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:41,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:41,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:41,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:41,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:12:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:41,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-18 20:12:41,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:41,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-18 20:12:41,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:12:41,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-18 20:12:41,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:12:41,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:12:41,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-18 20:12:41,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:12:41,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:12:41,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-18 20:12:41,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:12:41,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:12:41,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-18 20:12:41,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:12:41,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:12:42,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2022-11-18 20:12:42,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:12:42,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-18 20:12:42,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:12:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:42,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:06,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (not (<= (+ v_ArrVal_470 1) (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|))))))))) is different from false [2022-11-18 20:13:06,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|))))))))) is different from false [2022-11-18 20:13:06,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (not (<= (+ v_ArrVal_465 1) (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|)))))))))) is different from false [2022-11-18 20:13:06,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_465) (not (<= v_ArrVal_471 (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470)))))))) is different from false [2022-11-18 20:13:06,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_465) (not (<= v_ArrVal_471 (+ 2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470))))))))) is different from false [2022-11-18 20:14:07,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_456 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) (select .cse8 |c_ULTIMATE.start_main_~j~0#1.offset|))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_456 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_464))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_471 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (not (<= v_ArrVal_471 (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (not (<= v_ArrVal_456 (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2))))))))))))) is different from false [2022-11-18 20:14:07,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:07,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 767 treesize of output 467 [2022-11-18 20:14:07,324 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 902 treesize of output 894 [2022-11-18 20:14:07,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-18 20:14:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-18 20:14:07,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2022-11-18 20:14:07,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-18 20:14:07,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 406 [2022-11-18 20:14:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-11-18 20:14:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891671708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:07,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:07,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 28 [2022-11-18 20:14:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123157885] [2022-11-18 20:14:07,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:24,413 WARN L233 SmtUtils]: Spent 16.81s on a formula simplification. DAG size of input: 169 DAG size of output: 158 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 20:14:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:14:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=285, Unknown=15, NotChecked=270, Total=756 [2022-11-18 20:14:27,757 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:15:04,904 WARN L233 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 85 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:15:55,920 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:17:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:17:00,931 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-11-18 20:17:00,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2022-11-18 20:17:00,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2022-11-18 20:17:00,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2022-11-18 20:17:00,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-18 20:17:00,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-18 20:17:00,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2022-11-18 20:17:00,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:17:00,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-11-18 20:17:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2022-11-18 20:17:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-18 20:17:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:17:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-11-18 20:17:00,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-18 20:17:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:17:00,946 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-18 20:17:00,947 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-18 20:17:00,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2022-11-18 20:17:00,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-18 20:17:00,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:17:00,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:17:00,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-18 20:17:00,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2022-11-18 20:17:00,949 INFO L748 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 570#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 572#L552-4 [2022-11-18 20:17:00,949 INFO L750 eck$LassoCheckResult]: Loop: 572#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 573#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 577#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 576#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 574#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 575#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 602#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 601#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 600#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 599#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 598#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 597#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 596#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 595#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 594#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 593#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 592#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 591#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 590#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 589#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 588#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 587#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 586#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 585#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 584#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 583#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 582#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 581#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 579#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 580#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 578#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 571#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 572#L552-4 [2022-11-18 20:17:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-18 20:17:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012002079] [2022-11-18 20:17:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:00,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:17:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:00,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:17:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 4 times [2022-11-18 20:17:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:00,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219914477] [2022-11-18 20:17:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:01,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:17:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:01,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:17:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 2 times [2022-11-18 20:17:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802749625] [2022-11-18 20:17:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:01,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:17:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:17:01,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:18:28,596 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 257 DAG size of output: 247 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 20:18:40,571 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 20:18:41,331 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:18:41,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:18:41,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:18:41,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:18:41,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:18:41,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:18:41,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:18:41,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:18:41,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso [2022-11-18 20:18:41,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:18:41,333 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:18:41,341 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.base/java.lang.Math.toIntExact(Math.java:1074) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:551) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:615) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:908) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-18 20:18:41,344 INFO L158 Benchmark]: Toolchain (without parser) took 626177.68ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 77.6MB in the beginning and 131.1MB in the end (delta: -53.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2022-11-18 20:18:41,344 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 119.5MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:18:41,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.61ms. Allocated memory is still 119.5MB. Free memory was 77.4MB in the beginning and 89.3MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:18:41,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.98ms. Allocated memory is still 119.5MB. Free memory was 89.3MB in the beginning and 87.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:18:41,345 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 119.5MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:18:41,345 INFO L158 Benchmark]: RCFGBuilder took 342.64ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 74.7MB in the end (delta: 11.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 20:18:41,346 INFO L158 Benchmark]: BuchiAutomizer took 625188.44ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 74.2MB in the beginning and 131.1MB in the end (delta: -56.9MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2022-11-18 20:18:41,347 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 119.5MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.61ms. Allocated memory is still 119.5MB. Free memory was 77.4MB in the beginning and 89.3MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.98ms. Allocated memory is still 119.5MB. Free memory was 89.3MB in the beginning and 87.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 119.5MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.64ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 74.7MB in the end (delta: 11.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 625188.44ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 74.2MB in the beginning and 131.1MB in the end (delta: -56.9MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.base/java.lang.Math.toIntExact(Math.java:1074) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-18 20:18:41,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:18:41,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 20:18:41,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:18:42,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_199a72a8-20d5-43ec-a6b8-2beaca56cfa4/bin/uautomizer-TMbwUNV5ro/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow