./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:31:23,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:31:23,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:31:23,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:31:23,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:31:23,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:31:23,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:31:23,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:31:23,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:31:23,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:31:23,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:31:23,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:31:23,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:31:23,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:31:23,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:31:23,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:31:23,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:31:23,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:31:23,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:31:23,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:31:23,947 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:31:23,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:31:23,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:31:23,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:31:23,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:31:23,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:31:23,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:31:23,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:31:23,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:31:23,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:31:23,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:31:23,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:31:23,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:31:23,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:31:23,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:31:23,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:31:23,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:31:23,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:31:23,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:31:23,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:31:23,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:31:23,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:31:23,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:31:23,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:31:24,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:31:24,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:31:24,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:31:24,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:31:24,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:31:24,002 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:31:24,002 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:31:24,002 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:31:24,003 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:31:24,003 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:31:24,003 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:31:24,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:31:24,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:31:24,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:31:24,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:31:24,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:31:24,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:31:24,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:31:24,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:31:24,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:31:24,009 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2022-07-14 16:31:24,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:31:24,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:31:24,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:31:24,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:31:24,195 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:31:24,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2022-07-14 16:31:24,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cc72514/2eb0939c181d432bb80807191cf521b1/FLAG37c226941 [2022-07-14 16:31:24,629 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:31:24,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2022-07-14 16:31:24,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cc72514/2eb0939c181d432bb80807191cf521b1/FLAG37c226941 [2022-07-14 16:31:24,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cc72514/2eb0939c181d432bb80807191cf521b1 [2022-07-14 16:31:24,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:31:24,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:31:24,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:31:24,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:31:24,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:31:24,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277a8354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24, skipping insertion in model container [2022-07-14 16:31:24,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:31:24,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:31:24,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2022-07-14 16:31:24,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:31:24,826 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:31:24,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2022-07-14 16:31:24,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:31:24,848 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:31:24,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24 WrapperNode [2022-07-14 16:31:24,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:31:24,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:31:24,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:31:24,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:31:24,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,885 INFO L137 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2022-07-14 16:31:24,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:31:24,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:31:24,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:31:24,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:31:24,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:31:24,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:31:24,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:31:24,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:31:24,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (1/1) ... [2022-07-14 16:31:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:24,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:24,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 16:31:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:31:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 16:31:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 16:31:25,016 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:31:25,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:31:25,198 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:31:25,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:31:25,202 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 16:31:25,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:31:25 BoogieIcfgContainer [2022-07-14 16:31:25,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:31:25,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:31:25,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:31:25,207 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:31:25,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:31:25,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:31:24" (1/3) ... [2022-07-14 16:31:25,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6397d731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:31:25, skipping insertion in model container [2022-07-14 16:31:25,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:31:25,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:31:24" (2/3) ... [2022-07-14 16:31:25,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6397d731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:31:25, skipping insertion in model container [2022-07-14 16:31:25,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:31:25,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:31:25" (3/3) ... [2022-07-14 16:31:25,217 INFO L354 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2022-07-14 16:31:25,287 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:31:25,287 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:31:25,287 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:31:25,287 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:31:25,288 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:31:25,288 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:31:25,288 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:31:25,288 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:31:25,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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-07-14 16:31:25,314 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-14 16:31:25,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:25,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:25,318 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:31:25,318 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:31:25,319 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:31:25,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 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-07-14 16:31:25,323 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-14 16:31:25,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:25,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:25,323 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 16:31:25,324 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 16:31:25,329 INFO L752 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 21#L17-3true [2022-07-14 16:31:25,330 INFO L754 eck$LassoCheckResult]: Loop: 21#L17-3true assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 10#L17-2true init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 21#L17-3true [2022-07-14 16:31:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 16:31:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230042197] [2022-07-14 16:31:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 16:31:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:25,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650324833] [2022-07-14 16:31:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:25,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 16:31:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:25,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823508015] [2022-07-14 16:31:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:25,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:25,883 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:31:25,884 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:31:25,884 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:31:25,884 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:31:25,884 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:31:25,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:25,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:31:25,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:31:25,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2022-07-14 16:31:25,885 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:31:25,886 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:31:25,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:25,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:25,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:25,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:25,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:26,394 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:31:26,397 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:31:26,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 16:31:26,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:31:26,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:31:26,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:31:26,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 16:31:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 16:31:26,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:31:26,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:31:26,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:31:26,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 16:31:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 16:31:26,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:31:26,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:31:26,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:31:26,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 16:31:26,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:31:26,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:31:26,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 16:31:26,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:31:26,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:31:26,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:31:26,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 16:31:26,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:31:26,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:31:26,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,684 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 16:31:26,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:31:26,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:31:26,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:31:26,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 16:31:26,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:31:26,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:31:26,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:31:26,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-14 16:31:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,742 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 16:31:26,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 16:31:26,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:31:26,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:31:26,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:31:26,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:31:26,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 16:31:26,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 16:31:26,776 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:31:26,828 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 16:31:26,828 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-14 16:31:26,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:26,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:26,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:31:26,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 16:31:26,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:31:26,880 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 16:31:26,881 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:31:26,881 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 Supporting invariants [] [2022-07-14 16:31:26,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:26,918 INFO L293 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 16:31:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:26,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:31:26,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:26,968 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 16:31:26,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 16:31:27,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-07-14 16:31:27,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 75 states and 119 transitions. Complement of second has 8 states. [2022-07-14 16:31:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 16:31:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-07-14 16:31:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-07-14 16:31:27,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 16:31:27,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:31:27,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 16:31:27,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:31:27,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 16:31:27,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:31:27,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2022-07-14 16:31:27,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2022-07-14 16:31:27,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-14 16:31:27,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 16:31:27,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2022-07-14 16:31:27,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:27,094 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-14 16:31:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2022-07-14 16:31:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 16:31:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-07-14 16:31:27,111 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-14 16:31:27,111 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-07-14 16:31:27,111 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:31:27,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2022-07-14 16:31:27,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:27,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:27,112 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 16:31:27,113 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:27,113 INFO L752 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 196#L17-3 assume !(init_nondet_~i~0#1 < 10); 191#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 192#L28-3 [2022-07-14 16:31:27,113 INFO L754 eck$LassoCheckResult]: Loop: 192#L28-3 assume !!(rangesum_~i~1#1 < 10); 193#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 194#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 192#L28-3 [2022-07-14 16:31:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-14 16:31:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001062849] [2022-07-14 16:31:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:27,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001062849] [2022-07-14 16:31:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001062849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:31:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:31:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:31:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439771166] [2022-07-14 16:31:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:31:27,171 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:31:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2022-07-14 16:31:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345664586] [2022-07-14 16:31:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:31:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:31:27,231 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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-07-14 16:31:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:27,251 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2022-07-14 16:31:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:31:27,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2022-07-14 16:31:27,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2022-07-14 16:31:27,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 16:31:27,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 16:31:27,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2022-07-14 16:31:27,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:27,257 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-07-14 16:31:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2022-07-14 16:31:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-14 16:31:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-07-14 16:31:27,260 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-07-14 16:31:27,260 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-07-14 16:31:27,260 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:31:27,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-07-14 16:31:27,262 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:27,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:27,263 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 16:31:27,263 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:27,263 INFO L752 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 248#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 249#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 250#L17-3 assume !(init_nondet_~i~0#1 < 10); 242#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 243#L28-3 [2022-07-14 16:31:27,263 INFO L754 eck$LassoCheckResult]: Loop: 243#L28-3 assume !!(rangesum_~i~1#1 < 10); 244#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 245#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 243#L28-3 [2022-07-14 16:31:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-14 16:31:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856039454] [2022-07-14 16:31:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:27,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856039454] [2022-07-14 16:31:27,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856039454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:31:27,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485711998] [2022-07-14 16:31:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:31:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:27,312 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:31:27,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 16:31:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:27,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 16:31:27,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:31:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485711998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:31:27,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:31:27,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 16:31:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337310491] [2022-07-14 16:31:27,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:31:27,374 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:31:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2022-07-14 16:31:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433656733] [2022-07-14 16:31:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 16:31:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 16:31:27,427 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:27,452 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-07-14 16:31:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:31:27,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2022-07-14 16:31:27,453 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 37 transitions. [2022-07-14 16:31:27,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 16:31:27,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 16:31:27,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-07-14 16:31:27,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:27,454 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-14 16:31:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-07-14 16:31:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-14 16:31:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-07-14 16:31:27,458 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-14 16:31:27,458 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-14 16:31:27,458 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:31:27,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2022-07-14 16:31:27,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:27,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:27,462 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-14 16:31:27,462 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:27,463 INFO L752 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 337#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 338#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 339#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 340#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 352#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 351#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 350#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 349#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 348#L17-3 assume !(init_nondet_~i~0#1 < 10); 332#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 333#L28-3 [2022-07-14 16:31:27,463 INFO L754 eck$LassoCheckResult]: Loop: 333#L28-3 assume !!(rangesum_~i~1#1 < 10); 334#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 335#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 333#L28-3 [2022-07-14 16:31:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-14 16:31:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346499976] [2022-07-14 16:31:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346499976] [2022-07-14 16:31:27,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346499976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:31:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309600742] [2022-07-14 16:31:27,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 16:31:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:31:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:27,512 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:31:27,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 16:31:27,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 16:31:27,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 16:31:27,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:31:27,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:31:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:31:27,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309600742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:31:27,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:31:27,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 16:31:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026264544] [2022-07-14 16:31:27,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:31:27,633 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:31:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2022-07-14 16:31:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186097273] [2022-07-14 16:31:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 16:31:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 16:31:27,692 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:27,725 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-14 16:31:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 16:31:27,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2022-07-14 16:31:27,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2022-07-14 16:31:27,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-14 16:31:27,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-14 16:31:27,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2022-07-14 16:31:27,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:27,732 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-14 16:31:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2022-07-14 16:31:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-14 16:31:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-14 16:31:27,737 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-14 16:31:27,738 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-14 16:31:27,738 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:31:27,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-07-14 16:31:27,739 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:27,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:27,740 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-14 16:31:27,741 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:27,741 INFO L752 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 487#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 488#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 489#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 490#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 495#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 514#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 513#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 512#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 511#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 510#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 509#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 508#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 507#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 506#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 505#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 504#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 503#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 502#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 501#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 500#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 499#L17-3 assume !(init_nondet_~i~0#1 < 10); 482#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 483#L28-3 [2022-07-14 16:31:27,741 INFO L754 eck$LassoCheckResult]: Loop: 483#L28-3 assume !!(rangesum_~i~1#1 < 10); 484#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 485#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 483#L28-3 [2022-07-14 16:31:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-07-14 16:31:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042284858] [2022-07-14 16:31:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2022-07-14 16:31:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033327583] [2022-07-14 16:31:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2022-07-14 16:31:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353725947] [2022-07-14 16:31:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353725947] [2022-07-14 16:31:27,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353725947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:31:27,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:31:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:31:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79580718] [2022-07-14 16:31:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:31:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:31:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:31:27,922 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-07-14 16:31:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:27,955 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-07-14 16:31:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:31:27,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2022-07-14 16:31:27,959 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2022-07-14 16:31:27,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-14 16:31:27,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-14 16:31:27,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2022-07-14 16:31:27,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:27,962 INFO L369 hiAutomatonCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-14 16:31:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2022-07-14 16:31:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-07-14 16:31:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-07-14 16:31:27,968 INFO L392 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-14 16:31:27,968 INFO L374 stractBuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-14 16:31:27,968 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 16:31:27,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2022-07-14 16:31:27,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:27,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:27,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:27,970 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-07-14 16:31:27,970 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:27,970 INFO L752 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 573#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 585#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 586#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 587#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 588#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 617#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 616#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 615#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 614#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 613#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 612#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 611#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 610#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 609#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 608#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 607#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 606#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 605#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 604#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 603#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 600#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 599#L17-3 assume !(init_nondet_~i~0#1 < 10); 578#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 579#L28-3 assume !!(rangesum_~i~1#1 < 10); 580#L29 assume !(rangesum_~i~1#1 > 5); 581#L28-2 [2022-07-14 16:31:27,970 INFO L754 eck$LassoCheckResult]: Loop: 581#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 582#L28-3 assume !!(rangesum_~i~1#1 < 10); 602#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 581#L28-2 [2022-07-14 16:31:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2022-07-14 16:31:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:27,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127727506] [2022-07-14 16:31:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:27,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 5 times [2022-07-14 16:31:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172923312] [2022-07-14 16:31:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,013 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2022-07-14 16:31:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75904195] [2022-07-14 16:31:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75904195] [2022-07-14 16:31:28,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75904195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:31:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005033606] [2022-07-14 16:31:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:31:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:28,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:31:28,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 16:31:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:28,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 16:31:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:31:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005033606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:31:28,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:31:28,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-14 16:31:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206988229] [2022-07-14 16:31:28,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:31:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:28,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 16:31:28,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 16:31:28,214 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-07-14 16:31:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:28,286 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-07-14 16:31:28,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:31:28,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2022-07-14 16:31:28,288 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-14 16:31:28,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2022-07-14 16:31:28,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-07-14 16:31:28,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-14 16:31:28,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2022-07-14 16:31:28,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:28,291 INFO L369 hiAutomatonCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-07-14 16:31:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2022-07-14 16:31:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-07-14 16:31:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 72 states have internal predecessors, (82), 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-07-14 16:31:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-07-14 16:31:28,297 INFO L392 hiAutomatonCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-14 16:31:28,297 INFO L374 stractBuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-14 16:31:28,298 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 16:31:28,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2022-07-14 16:31:28,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:28,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:28,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:28,299 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2022-07-14 16:31:28,299 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:28,300 INFO L752 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 887#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 888#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 889#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 890#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 924#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 923#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 922#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 921#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 920#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 919#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 918#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 917#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 916#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 915#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 914#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 913#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 912#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 911#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 910#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 903#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 902#L17-3 assume !(init_nondet_~i~0#1 < 10); 880#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 881#L28-3 assume !!(rangesum_~i~1#1 < 10); 931#L29 assume !(rangesum_~i~1#1 > 5); 884#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 885#L28-3 assume !!(rangesum_~i~1#1 < 10); 882#L29 assume !(rangesum_~i~1#1 > 5); 883#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 929#L28-3 assume !!(rangesum_~i~1#1 < 10); 928#L29 assume !(rangesum_~i~1#1 > 5); 927#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 926#L28-3 assume !!(rangesum_~i~1#1 < 10); 925#L29 assume !(rangesum_~i~1#1 > 5); 909#L28-2 [2022-07-14 16:31:28,300 INFO L754 eck$LassoCheckResult]: Loop: 909#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 906#L28-3 assume !!(rangesum_~i~1#1 < 10); 907#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 909#L28-2 [2022-07-14 16:31:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 1 times [2022-07-14 16:31:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132695638] [2022-07-14 16:31:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,330 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 6 times [2022-07-14 16:31:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347151715] [2022-07-14 16:31:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 2 times [2022-07-14 16:31:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49689096] [2022-07-14 16:31:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:31:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:31:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49689096] [2022-07-14 16:31:28,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49689096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 16:31:28,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996106379] [2022-07-14 16:31:28,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 16:31:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 16:31:28,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:31:28,425 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 16:31:28,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 16:31:28,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 16:31:28,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 16:31:28,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 16:31:28,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:31:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 16:31:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-14 16:31:28,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996106379] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 16:31:28,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 16:31:28,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-14 16:31:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61079983] [2022-07-14 16:31:28,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 16:31:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:31:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 16:31:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-14 16:31:28,569 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:31:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:31:28,657 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-07-14 16:31:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 16:31:28,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2022-07-14 16:31:28,659 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-14 16:31:28,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2022-07-14 16:31:28,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2022-07-14 16:31:28,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2022-07-14 16:31:28,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2022-07-14 16:31:28,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:31:28,661 INFO L369 hiAutomatonCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-14 16:31:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2022-07-14 16:31:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-14 16:31:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.098901098901099) internal successors, (100), 90 states have internal predecessors, (100), 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-07-14 16:31:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-14 16:31:28,663 INFO L392 hiAutomatonCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-14 16:31:28,663 INFO L374 stractBuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-14 16:31:28,663 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 16:31:28,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2022-07-14 16:31:28,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-14 16:31:28,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:31:28,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:31:28,664 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2022-07-14 16:31:28,664 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 16:31:28,664 INFO L752 eck$LassoCheckResult]: Stem: 1277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet2#1, init_nondet_#t~post1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1290#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1291#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1292#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1293#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1329#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1328#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1327#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1326#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1325#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1324#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1323#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1322#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1321#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1320#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1319#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1318#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1317#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1316#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1315#L17-3 assume !!(init_nondet_~i~0#1 < 10);call write~int(init_nondet_#t~nondet2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet2#1; 1308#L17-2 init_nondet_#t~post1#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post1#1;havoc init_nondet_#t~post1#1; 1307#L17-3 assume !(init_nondet_~i~0#1 < 10); 1283#L15 assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem4#1, rangesum_#t~post3#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1284#L28-3 assume !!(rangesum_~i~1#1 < 10); 1342#L29 assume !(rangesum_~i~1#1 > 5); 1287#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1288#L28-3 assume !!(rangesum_~i~1#1 < 10); 1285#L29 assume !(rangesum_~i~1#1 > 5); 1286#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1340#L28-3 assume !!(rangesum_~i~1#1 < 10); 1339#L29 assume !(rangesum_~i~1#1 > 5); 1338#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1337#L28-3 assume !!(rangesum_~i~1#1 < 10); 1336#L29 assume !(rangesum_~i~1#1 > 5); 1335#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1334#L28-3 assume !!(rangesum_~i~1#1 < 10); 1333#L29 assume !(rangesum_~i~1#1 > 5); 1332#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1331#L28-3 assume !!(rangesum_~i~1#1 < 10); 1330#L29 assume !(rangesum_~i~1#1 > 5); 1314#L28-2 [2022-07-14 16:31:28,665 INFO L754 eck$LassoCheckResult]: Loop: 1314#L28-2 rangesum_#t~post3#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post3#1;havoc rangesum_#t~post3#1; 1311#L28-3 assume !!(rangesum_~i~1#1 < 10); 1312#L29 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem4#1 := read~int(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem4#1;havoc rangesum_#t~mem4#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1314#L28-2 [2022-07-14 16:31:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 2 times [2022-07-14 16:31:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280059592] [2022-07-14 16:31:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2022-07-14 16:31:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949940297] [2022-07-14 16:31:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:31:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 3 times [2022-07-14 16:31:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:31:28,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374765844] [2022-07-14 16:31:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:31:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:31:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:31:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:31:28,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:31:34,267 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:31:34,267 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:31:34,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:31:34,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:31:34,267 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:31:34,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:31:34,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:31:34,267 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:31:34,267 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration8_Lasso [2022-07-14 16:31:34,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:31:34,267 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:31:34,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:34,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:34,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:31:35,184 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) 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:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) 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-07-14 16:31:35,188 INFO L158 Benchmark]: Toolchain (without parser) took 10540.35ms. Allocated memory was 121.6MB in the beginning and 172.0MB in the end (delta: 50.3MB). Free memory was 88.9MB in the beginning and 107.6MB in the end (delta: -18.7MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,189 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:31:35,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.00ms. Allocated memory is still 121.6MB. Free memory was 88.7MB in the beginning and 97.2MB in the end (delta: -8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.44ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,189 INFO L158 Benchmark]: Boogie Preprocessor took 18.02ms. Allocated memory is still 121.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,189 INFO L158 Benchmark]: RCFGBuilder took 298.73ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 80.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,190 INFO L158 Benchmark]: BuchiAutomizer took 9983.08ms. Allocated memory was 121.6MB in the beginning and 172.0MB in the end (delta: 50.3MB). Free memory was 80.4MB in the beginning and 107.6MB in the end (delta: -27.2MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2022-07-14 16:31:35,191 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.15ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.00ms. Allocated memory is still 121.6MB. Free memory was 88.7MB in the beginning and 97.2MB in the end (delta: -8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.44ms. Allocated memory is still 121.6MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.02ms. Allocated memory is still 121.6MB. Free memory was 95.1MB in the beginning and 93.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.73ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 80.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9983.08ms. Allocated memory was 121.6MB in the beginning and 172.0MB in the end (delta: 50.3MB). Free memory was 80.4MB in the beginning and 107.6MB in the end (delta: -27.2MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 16:31:35,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:35,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-14 16:31:35,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 16:31:35,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 16:31:36,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null