./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/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_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 16:44:40,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:44:40,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:44:40,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:44:40,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:44:40,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:44:40,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:44:40,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:44:40,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:44:40,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:44:40,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:44:40,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:44:40,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:44:40,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:44:40,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:44:40,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:44:40,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:44:40,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:44:40,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:44:40,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:44:40,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:44:40,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:44:40,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:44:40,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:44:40,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:44:40,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:44:40,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:44:40,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:44:40,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:44:40,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:44:40,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:44:40,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:44:40,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:44:40,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:44:40,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:44:40,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:44:40,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:44:40,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:44:40,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:44:40,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:44:40,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:44:40,901 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-25 16:44:40,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:44:40,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:44:40,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:44:40,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:44:40,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:44:40,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:44:40,926 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:44:40,926 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 16:44:40,927 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 16:44:40,927 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 16:44:40,927 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 16:44:40,927 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 16:44:40,928 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 16:44:40,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:44:40,928 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:44:40,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:44:40,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:44:40,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 16:44:40,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 16:44:40,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 16:44:40,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:44:40,930 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 16:44:40,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:44:40,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 16:44:40,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:44:40,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:44:40,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:44:40,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:44:40,932 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 16:44:40,932 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_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/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_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R 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-25 16:44:41,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:44:41,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:44:41,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:44:41,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:44:41,227 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:44:41,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-25 16:44:44,262 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:44:44,531 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:44:44,531 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2022-11-25 16:44:44,553 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/data/9a3519c9b/d9996e8f939f46d8be8e614752b56880/FLAGb2880de43 [2022-11-25 16:44:44,577 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/data/9a3519c9b/d9996e8f939f46d8be8e614752b56880 [2022-11-25 16:44:44,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:44:44,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:44:44,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:44:44,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:44:44,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:44:44,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:44:44" (1/1) ... [2022-11-25 16:44:44,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5957409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:44, skipping insertion in model container [2022-11-25 16:44:44,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:44:44" (1/1) ... [2022-11-25 16:44:44,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:44:44,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:44:44,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:44:44,920 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:44:44,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:44:45,016 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:44:45,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45 WrapperNode [2022-11-25 16:44:45,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:44:45,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:44:45,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:44:45,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:44:45,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,076 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-11-25 16:44:45,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:44:45,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:44:45,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:44:45,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:44:45,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,116 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:44:45,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:44:45,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:44:45,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:44:45,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (1/1) ... [2022-11-25 16:44:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:44:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:44:45,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:44:45,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 16:44:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:44:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:44:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:44:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:44:45,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:44:45,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:44:45,347 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:44:45,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:44:45,576 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:44:45,582 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:44:45,582 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:44:45,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:44:45 BoogieIcfgContainer [2022-11-25 16:44:45,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:44:45,585 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 16:44:45,585 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 16:44:45,598 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 16:44:45,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:44:45,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 04:44:44" (1/3) ... [2022-11-25 16:44:45,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58fc962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:44:45, skipping insertion in model container [2022-11-25 16:44:45,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:44:45,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:44:45" (2/3) ... [2022-11-25 16:44:45,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58fc962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:44:45, skipping insertion in model container [2022-11-25 16:44:45,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:44:45,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:44:45" (3/3) ... [2022-11-25 16:44:45,602 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2022-11-25 16:44:45,694 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 16:44:45,695 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 16:44:45,695 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 16:44:45,695 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 16:44:45,695 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 16:44:45,695 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 16:44:45,695 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 16:44:45,696 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 16:44:45,700 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-25 16:44:45,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 16:44:45,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:44:45,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:44:45,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:44:45,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-25 16:44:45,729 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 16:44:45,729 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-25 16:44:45,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 16:44:45,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:44:45,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:44:45,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:44:45,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-25 16:44:45,741 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-25 16:44:45,742 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-25 16:44:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-25 16:44:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:45,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306090560] [2022-11-25 16:44:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:45,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:44:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:46,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:44:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2022-11-25 16:44:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819086687] [2022-11-25 16:44:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:44:46,110 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-25 16:44:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:44:46,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819086687] [2022-11-25 16:44:46,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819086687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:44:46,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:44:46,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:44:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299704131] [2022-11-25 16:44:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:44:46,118 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:44:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:44:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:44:46,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:44:46,166 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-25 16:44:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:44:46,176 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-25 16:44:46,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2022-11-25 16:44:46,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 16:44:46,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2022-11-25 16:44:46,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-11-25 16:44:46,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-11-25 16:44:46,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2022-11-25 16:44:46,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:44:46,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-25 16:44:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2022-11-25 16:44:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-25 16:44:46,214 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-25 16:44:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-25 16:44:46,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-25 16:44:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:44:46,225 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-25 16:44:46,225 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 16:44:46,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-11-25 16:44:46,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-25 16:44:46,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:44:46,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:44:46,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:44:46,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-11-25 16:44:46,228 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-25 16:44:46,229 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-25 16:44:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-25 16:44:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472540349] [2022-11-25 16:44:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:46,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:44:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:46,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:44:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2022-11-25 16:44:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:46,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865945524] [2022-11-25 16:44:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:44:46,432 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-25 16:44:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:44:46,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865945524] [2022-11-25 16:44:46,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865945524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:44:46,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:44:46,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:44:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614320060] [2022-11-25 16:44:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:44:46,434 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:44:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:44:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:44:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:44:46,435 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-25 16:44:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:44:46,478 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-11-25 16:44:46,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-11-25 16:44:46,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-11-25 16:44:46,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2022-11-25 16:44:46,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-11-25 16:44:46,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-25 16:44:46,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2022-11-25 16:44:46,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:44:46,480 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-25 16:44:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2022-11-25 16:44:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-11-25 16:44:46,482 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-25 16:44:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-25 16:44:46,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-25 16:44:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:44:46,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-25 16:44:46,484 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 16:44:46,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-11-25 16:44:46,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-25 16:44:46,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:44:46,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:44:46,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:44:46,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-25 16:44:46,486 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-25 16:44:46,486 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-25 16:44:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-25 16:44:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610455211] [2022-11-25 16:44:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:46,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:44:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:46,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:44:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2022-11-25 16:44:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705123047] [2022-11-25 16:44:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:44:47,164 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-25 16:44:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:44:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705123047] [2022-11-25 16:44:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705123047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:44:47,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331281328] [2022-11-25 16:44:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:44:47,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:44:47,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:44:47,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:44:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:44:47,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 16:44:47,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:44:47,355 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-25 16:44:47,465 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-25 16:44:47,466 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-25 16:44:47,552 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-25 16:44:47,569 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-25 16:44:47,579 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-25 16:44:47,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:44:47,640 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-25 16:44:47,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331281328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:44:47,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:44:47,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-25 16:44:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471778761] [2022-11-25 16:44:47,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:44:47,642 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:44:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:44:47,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:44:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:44:47,643 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-25 16:44:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:44:47,735 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-25 16:44:47,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-11-25 16:44:47,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-11-25 16:44:47,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2022-11-25 16:44:47,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-25 16:44:47,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-25 16:44:47,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2022-11-25 16:44:47,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:44:47,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-25 16:44:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2022-11-25 16:44:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-11-25 16:44:47,739 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-25 16:44:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-25 16:44:47,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-25 16:44:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:44:47,741 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-25 16:44:47,741 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 16:44:47,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2022-11-25 16:44:47,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-25 16:44:47,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:44:47,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:44:47,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:44:47,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2022-11-25 16:44:47,743 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-25 16:44:47,743 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-25 16:44:47,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-25 16:44:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:47,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563157785] [2022-11-25 16:44:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:47,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:44:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:44:47,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:44:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:44:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2022-11-25 16:44:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:44:47,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127354141] [2022-11-25 16:44:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:44:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:44:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:44:49,757 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-25 16:44:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:44:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127354141] [2022-11-25 16:44:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127354141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:44:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562342411] [2022-11-25 16:44:49,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:44:49,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:44:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:44:49,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:44:49,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:44:49,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:44:49,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:44:49,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 16:44:49,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:44:49,911 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-25 16:44:49,964 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-25 16:44:49,965 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-25 16:44:50,048 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-25 16:44:50,141 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-25 16:44:50,141 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-25 16:44:50,228 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-25 16:44:50,337 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-25 16:44:50,338 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-25 16:44:50,439 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-25 16:44:50,536 INFO L321 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-11-25 16:44:50,536 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-25 16:44:50,645 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-25 16:44:50,653 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-25 16:44:50,657 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-25 16:44:50,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:29,276 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-25 16:49:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562342411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:49:29,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:49:29,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 21 [2022-11-25 16:49:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521115766] [2022-11-25 16:49:29,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:49:29,278 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:49:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:49:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 16:49:29,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=256, Unknown=22, NotChecked=0, Total=420 [2022-11-25 16:49:29,279 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-25 16:49:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:49:29,852 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-11-25 16:49:29,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-11-25 16:49:29,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-11-25 16:49:29,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2022-11-25 16:49:29,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-25 16:49:29,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-25 16:49:29,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2022-11-25 16:49:29,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:49:29,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-25 16:49:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2022-11-25 16:49:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-11-25 16:49:29,861 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-25 16:49:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-25 16:49:29,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-25 16:49:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 16:49:29,865 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-25 16:49:29,865 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 16:49:29,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-11-25 16:49:29,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-11-25 16:49:29,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:49:29,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:49:29,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:49:29,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2022-11-25 16:49:29,867 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-25 16:49:29,867 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-25 16:49:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-25 16:49:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:29,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433618591] [2022-11-25 16:49:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:49:29,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:49:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:49:29,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:49:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 3 times [2022-11-25 16:49:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056582964] [2022-11-25 16:49:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:49:29,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:49:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:49:29,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:49:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:49:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2022-11-25 16:49:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:49:29,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605636075] [2022-11-25 16:49:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:49:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:31,384 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-25 16:49:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:49:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605636075] [2022-11-25 16:49:31,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605636075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:49:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624005184] [2022-11-25 16:49:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:49:31,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:49:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:49:31,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:49:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:49:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:49:31,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-25 16:49:31,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:49:31,559 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-25 16:49:31,586 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-25 16:49:31,620 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-25 16:49:31,627 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-25 16:49:31,648 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-25 16:49:31,674 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-25 16:49:31,683 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-25 16:49:31,706 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-25 16:49:31,741 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-25 16:49:31,748 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-25 16:49:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-25 16:49:31,787 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-25 16:49:31,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 14 treesize of output 16 [2022-11-25 16:49:31,812 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-25 16:49:31,832 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-25 16:49:31,838 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-25 16:49:31,849 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-25 16:49:31,858 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-25 16:49:31,862 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-25 16:49:31,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:49:56,144 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-25 16:49:56,198 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-25 16:49:56,238 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-25 16:49:56,309 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-25 16:51:24,583 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-25 16:51:24,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:51:24,664 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-25 16:51:24,742 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-25 16:51:24,766 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-25 16:51:24,788 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-25 16:51:24,808 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-25 16:51:24,828 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-25 16:51:24,849 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-25 16:51:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-25 16:51:24,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624005184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:51:24,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:51:24,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 28 [2022-11-25 16:51:24,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856568107] [2022-11-25 16:51:24,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:51:40,413 WARN L233 SmtUtils]: Spent 15.43s 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-25 16:51:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:51:43,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 16:51:43,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=306, Unknown=22, NotChecked=230, Total=756 [2022-11-25 16:51:43,814 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-25 16:51:44,409 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|))) (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_471 Int) (v_ArrVal_470 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse1 (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_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) .cse0)) (< (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|)))))))) (forall ((v_ArrVal_475 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (- 1) .cse0))) |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)) (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 ((.cse7 (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 ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_470)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |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 .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|)))) (< (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_470) (not (<= (+ v_ArrVal_465 1) .cse0)))))))) (forall ((v_ArrVal_471 Int) (v_ArrVal_475 (Array Int Int))) (or (< (select (select (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_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 (+ .cse0 2)))))))) is different from false [2022-11-25 16:51:47,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 16:52:30,876 WARN L233 SmtUtils]: Spent 12.04s 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-25 16:53:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:19,343 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-11-25 16:53:19,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2022-11-25 16:53:19,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2022-11-25 16:53:19,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2022-11-25 16:53:19,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-25 16:53:19,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-25 16:53:19,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2022-11-25 16:53:19,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:53:19,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-11-25 16:53:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2022-11-25 16:53:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-25 16:53:19,348 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-25 16:53:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-11-25 16:53:19,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-25 16:53:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 16:53:19,350 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-25 16:53:19,350 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 16:53:19,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2022-11-25 16:53:19,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-11-25 16:53:19,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:53:19,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:53:19,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-25 16:53:19,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2022-11-25 16:53:19,352 INFO L748 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 569#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); 571#L552-4 [2022-11-25 16:53:19,352 INFO L750 eck$LassoCheckResult]: Loop: 571#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 572#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); 576#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 575#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; 573#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; 574#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 601#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; 600#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; 599#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 598#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; 597#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; 596#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 595#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; 594#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; 593#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 592#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; 591#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; 590#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 589#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; 588#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; 587#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 586#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; 585#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; 584#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 583#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; 582#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; 581#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 580#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; 578#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; 579#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 577#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 570#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; 571#L552-4 [2022-11-25 16:53:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-25 16:53:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:19,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286096522] [2022-11-25 16:53:19,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:53:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:53:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 4 times [2022-11-25 16:53:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:19,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524854353] [2022-11-25 16:53:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:53:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:53:19,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 2 times [2022-11-25 16:53:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:19,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012065955] [2022-11-25 16:53:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:53:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:53:19,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:54:51,326 WARN L233 SmtUtils]: Spent 1.53m 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-25 16:55:03,360 WARN L233 SmtUtils]: Spent 5.99s 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-25 16:55:04,036 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:55:04,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:55:04,037 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:55:04,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:55:04,037 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:55:04,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:55:04,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:55:04,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:55:04,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration6_Lasso [2022-11-25 16:55:04,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:55:04,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:55:04,046 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-25 16:55:04,058 INFO L158 Benchmark]: Toolchain (without parser) took 619468.15ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 115.9MB in the beginning and 92.4MB in the end (delta: 23.5MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,058 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 88.7MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:55:04,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.81ms. Allocated memory is still 144.7MB. Free memory was 115.9MB in the beginning and 100.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.00ms. Allocated memory is still 144.7MB. Free memory was 100.3MB in the beginning and 98.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,061 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 144.7MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,061 INFO L158 Benchmark]: RCFGBuilder took 464.29ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 110.5MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,063 INFO L158 Benchmark]: BuchiAutomizer took 618467.64ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 110.5MB in the beginning and 92.4MB in the end (delta: 18.1MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2022-11-25 16:55:04,064 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.29ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 88.7MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.81ms. Allocated memory is still 144.7MB. Free memory was 115.9MB in the beginning and 100.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.00ms. Allocated memory is still 144.7MB. Free memory was 100.3MB in the beginning and 98.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 144.7MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.29ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 110.5MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 618467.64ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 110.5MB in the beginning and 92.4MB in the end (delta: 18.1MB). Peak memory consumption was 125.7MB. 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-25 16:55:04,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:04,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:55:04,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 16:55:04,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d82c38a6-7f1b-4297-8fcf-60112b3c27fb/bin/uautomizer-ZsLfNo2U6R/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