./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 22:32:51,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 22:32:51,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 22:32:51,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 22:32:51,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 22:32:51,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 22:32:51,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 22:32:51,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 22:32:51,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 22:32:51,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 22:32:51,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 22:32:51,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 22:32:51,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 22:32:51,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 22:32:51,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 22:32:51,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 22:32:51,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 22:32:51,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 22:32:51,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 22:32:51,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 22:32:51,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 22:32:51,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 22:32:51,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 22:32:51,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 22:32:51,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 22:32:51,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 22:32:51,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 22:32:51,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 22:32:51,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 22:32:51,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 22:32:51,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 22:32:51,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 22:32:51,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 22:32:51,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 22:32:51,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 22:32:51,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 22:32:51,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 22:32:51,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 22:32:51,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 22:32:51,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 22:32:51,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 22:32:51,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 22:32:51,840 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 22:32:51,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 22:32:51,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 22:32:51,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 22:32:51,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 22:32:51,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 22:32:51,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 22:32:51,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 22:32:51,843 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 22:32:51,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 22:32:51,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 22:32:51,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 22:32:51,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 22:32:51,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 22:32:51,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 22:32:51,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 22:32:51,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 22:32:51,845 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 22:32:51,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 22:32:51,845 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 22:32:51,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 22:32:51,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 22:32:51,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 22:32:51,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 22:32:51,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 22:32:51,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 22:32:51,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 22:32:51,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 22:32:51,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 22:32:51,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 22:32:51,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 22:32:51,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 22:32:51,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 22:32:51,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 22:32:51,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2021-12-16 22:32:52,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 22:32:52,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 22:32:52,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 22:32:52,072 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 22:32:52,076 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 22:32:52,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-12-16 22:32:52,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293e5c768/829f229df74f49fc985cd18d504e010c/FLAG93dc83f1f [2021-12-16 22:32:52,501 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 22:32:52,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2021-12-16 22:32:52,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293e5c768/829f229df74f49fc985cd18d504e010c/FLAG93dc83f1f [2021-12-16 22:32:52,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293e5c768/829f229df74f49fc985cd18d504e010c [2021-12-16 22:32:52,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 22:32:52,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 22:32:52,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 22:32:52,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 22:32:52,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 22:32:52,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abda54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52, skipping insertion in model container [2021-12-16 22:32:52,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 22:32:52,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 22:32:52,675 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/sum05-2.i[1271,1284] [2021-12-16 22:32:52,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 22:32:52,682 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 22:32:52,695 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/sum05-2.i[1271,1284] [2021-12-16 22:32:52,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 22:32:52,705 INFO L208 MainTranslator]: Completed translation [2021-12-16 22:32:52,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52 WrapperNode [2021-12-16 22:32:52,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 22:32:52,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 22:32:52,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 22:32:52,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 22:32:52,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,729 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2021-12-16 22:32:52,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 22:32:52,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 22:32:52,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 22:32:52,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 22:32:52,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 22:32:52,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 22:32:52,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 22:32:52,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 22:32:52,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (1/1) ... [2021-12-16 22:32:52,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 22:32:52,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:52,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 22:32:52,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 22:32:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 22:32:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-12-16 22:32:52,821 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-12-16 22:32:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 22:32:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 22:32:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 22:32:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 22:32:52,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 22:32:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 22:32:52,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 22:32:52,866 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 22:32:52,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 22:32:52,987 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 22:32:53,004 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 22:32:53,005 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 22:32:53,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:32:53 BoogieIcfgContainer [2021-12-16 22:32:53,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 22:32:53,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 22:32:53,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 22:32:53,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 22:32:53,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:32:52" (1/3) ... [2021-12-16 22:32:53,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b88f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:32:53, skipping insertion in model container [2021-12-16 22:32:53,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:32:52" (2/3) ... [2021-12-16 22:32:53,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656b88f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:32:53, skipping insertion in model container [2021-12-16 22:32:53,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:32:53" (3/3) ... [2021-12-16 22:32:53,028 INFO L111 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2021-12-16 22:32:53,033 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 22:32:53,033 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 22:32:53,063 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 22:32:53,068 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 22:32:53,068 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 22:32:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 22:32:53,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:53,083 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:53,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash -141219973, now seen corresponding path program 1 times [2021-12-16 22:32:53,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147630688] [2021-12-16 22:32:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:53,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 22:32:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 22:32:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 22:32:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 22:32:53,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:53,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147630688] [2021-12-16 22:32:53,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147630688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722476691] [2021-12-16 22:32:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:53,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:53,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:53,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 22:32:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 22:32:53,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 22:32:53,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 22:32:53,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722476691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 22:32:53,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 22:32:53,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-12-16 22:32:53,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089662950] [2021-12-16 22:32:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 22:32:53,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 22:32:53,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 22:32:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 22:32:53,496 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 22:32:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:53,525 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2021-12-16 22:32:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 22:32:53,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-12-16 22:32:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:53,534 INFO L225 Difference]: With dead ends: 50 [2021-12-16 22:32:53,535 INFO L226 Difference]: Without dead ends: 24 [2021-12-16 22:32:53,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 22:32:53,541 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:53,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-16 22:32:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-12-16 22:32:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-16 22:32:53,574 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28 [2021-12-16 22:32:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:53,575 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-16 22:32:53,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 22:32:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-16 22:32:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 22:32:53,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:53,578 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:53,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 22:32:53,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-16 22:32:53,794 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:53,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -618478211, now seen corresponding path program 1 times [2021-12-16 22:32:53,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:53,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039957063] [2021-12-16 22:32:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:53,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-16 22:32:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 22:32:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 22:32:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-16 22:32:53,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:53,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039957063] [2021-12-16 22:32:53,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039957063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860475675] [2021-12-16 22:32:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:53,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:53,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:53,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:53,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 22:32:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:53,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 22:32:53,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 22:32:54,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 22:32:54,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860475675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 22:32:54,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 22:32:54,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-12-16 22:32:54,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14102612] [2021-12-16 22:32:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 22:32:54,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 22:32:54,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 22:32:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 22:32:54,014 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:32:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:54,021 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-16 22:32:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 22:32:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2021-12-16 22:32:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:54,022 INFO L225 Difference]: With dead ends: 42 [2021-12-16 22:32:54,022 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 22:32:54,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 22:32:54,023 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:54,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 22:32:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 22:32:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-16 22:32:54,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2021-12-16 22:32:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:54,028 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-16 22:32:54,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:32:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-16 22:32:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 22:32:54,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:54,029 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:54,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-16 22:32:54,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-16 22:32:54,246 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1511029509, now seen corresponding path program 1 times [2021-12-16 22:32:54,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:54,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201210378] [2021-12-16 22:32:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:54,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-16 22:32:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-16 22:32:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-16 22:32:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-16 22:32:54,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201210378] [2021-12-16 22:32:54,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201210378] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520745748] [2021-12-16 22:32:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:54,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:54,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:54,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 22:32:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 22:32:54,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 22:32:54,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 22:32:54,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520745748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 22:32:54,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 22:32:54,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 22:32:54,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203538959] [2021-12-16 22:32:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 22:32:54,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 22:32:54,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:54,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 22:32:54,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:54,433 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:32:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:54,441 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-16 22:32:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 22:32:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2021-12-16 22:32:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:54,442 INFO L225 Difference]: With dead ends: 39 [2021-12-16 22:32:54,442 INFO L226 Difference]: Without dead ends: 26 [2021-12-16 22:32:54,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:54,443 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:54,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-16 22:32:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-16 22:32:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-16 22:32:54,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 36 [2021-12-16 22:32:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:54,448 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-16 22:32:54,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:32:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2021-12-16 22:32:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 22:32:54,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:54,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:54,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 22:32:54,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:54,667 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1553738215, now seen corresponding path program 1 times [2021-12-16 22:32:54,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:54,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723650377] [2021-12-16 22:32:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:54,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-16 22:32:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-16 22:32:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 22:32:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 22:32:54,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:54,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723650377] [2021-12-16 22:32:54,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723650377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:54,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58466580] [2021-12-16 22:32:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:54,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:54,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:54,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:54,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 22:32:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:54,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 22:32:54,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 22:32:54,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 22:32:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-16 22:32:54,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58466580] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 22:32:54,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 22:32:54,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2021-12-16 22:32:54,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246200643] [2021-12-16 22:32:54,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 22:32:54,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 22:32:54,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:54,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 22:32:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-16 22:32:54,971 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 22:32:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:54,996 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2021-12-16 22:32:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 22:32:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2021-12-16 22:32:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:55,003 INFO L225 Difference]: With dead ends: 54 [2021-12-16 22:32:55,003 INFO L226 Difference]: Without dead ends: 34 [2021-12-16 22:32:55,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-16 22:32:55,005 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:55,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-16 22:32:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-16 22:32:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-12-16 22:32:55,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2021-12-16 22:32:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:55,009 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-12-16 22:32:55,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-16 22:32:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-12-16 22:32:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-16 22:32:55,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:55,010 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:55,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 22:32:55,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:55,221 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1124150243, now seen corresponding path program 2 times [2021-12-16 22:32:55,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:55,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921991539] [2021-12-16 22:32:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:55,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 22:32:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 22:32:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 22:32:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-16 22:32:55,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921991539] [2021-12-16 22:32:55,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921991539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315974904] [2021-12-16 22:32:55,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 22:32:55,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:55,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:55,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 22:32:55,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 22:32:55,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 22:32:55,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 22:32:55,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-16 22:32:55,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 22:32:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-16 22:32:55,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315974904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 22:32:55,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 22:32:55,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2021-12-16 22:32:55,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053407647] [2021-12-16 22:32:55,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 22:32:55,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 22:32:55,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:55,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 22:32:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-16 22:32:55,575 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 22:32:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:55,600 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-12-16 22:32:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 22:32:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2021-12-16 22:32:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:55,601 INFO L225 Difference]: With dead ends: 60 [2021-12-16 22:32:55,601 INFO L226 Difference]: Without dead ends: 38 [2021-12-16 22:32:55,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-16 22:32:55,602 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:55,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-16 22:32:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-12-16 22:32:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2021-12-16 22:32:55,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 50 [2021-12-16 22:32:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:55,607 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-12-16 22:32:55,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-16 22:32:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2021-12-16 22:32:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-16 22:32:55,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:55,608 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:55,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 22:32:55,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:55,817 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -402148163, now seen corresponding path program 3 times [2021-12-16 22:32:55,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981336247] [2021-12-16 22:32:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:55,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 22:32:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-16 22:32:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 22:32:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 22:32:55,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981336247] [2021-12-16 22:32:55,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981336247] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110787731] [2021-12-16 22:32:55,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 22:32:55,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:55,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:55,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:55,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 22:32:55,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-16 22:32:55,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 22:32:55,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 22:32:55,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 22:32:56,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 22:32:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-16 22:32:56,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110787731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 22:32:56,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 22:32:56,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-16 22:32:56,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989961141] [2021-12-16 22:32:56,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 22:32:56,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 22:32:56,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 22:32:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:56,111 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 22:32:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:56,132 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-12-16 22:32:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 22:32:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2021-12-16 22:32:56,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:56,134 INFO L225 Difference]: With dead ends: 66 [2021-12-16 22:32:56,134 INFO L226 Difference]: Without dead ends: 43 [2021-12-16 22:32:56,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:56,135 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:56,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-16 22:32:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-16 22:32:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2021-12-16 22:32:56,139 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 54 [2021-12-16 22:32:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:56,139 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-12-16 22:32:56,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-16 22:32:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2021-12-16 22:32:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-16 22:32:56,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:56,140 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:56,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 22:32:56,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:56,357 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 354187703, now seen corresponding path program 4 times [2021-12-16 22:32:56,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618724140] [2021-12-16 22:32:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:56,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 22:32:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 22:32:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-16 22:32:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-16 22:32:56,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:32:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618724140] [2021-12-16 22:32:56,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618724140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:32:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828237053] [2021-12-16 22:32:56,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 22:32:56,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:32:56,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:32:56,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-16 22:32:56,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 22:32:56,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 22:32:56,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 22:32:56,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:32:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 130 proven. 4 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-12-16 22:32:56,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 22:32:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-16 22:32:56,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828237053] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 22:32:56,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 22:32:56,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-16 22:32:56,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465044054] [2021-12-16 22:32:56,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 22:32:56,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 22:32:56,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:32:56,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 22:32:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:56,661 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 22:32:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:32:56,679 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2021-12-16 22:32:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 22:32:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2021-12-16 22:32:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:32:56,680 INFO L225 Difference]: With dead ends: 68 [2021-12-16 22:32:56,680 INFO L226 Difference]: Without dead ends: 47 [2021-12-16 22:32:56,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 22:32:56,681 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:32:56,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:32:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-16 22:32:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-16 22:32:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:32:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2021-12-16 22:32:56,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 72 [2021-12-16 22:32:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:32:56,685 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2021-12-16 22:32:56,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-16 22:32:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2021-12-16 22:32:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-16 22:32:56,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:32:56,687 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:32:56,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 22:32:56,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:32:56,904 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:32:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:32:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash -783200653, now seen corresponding path program 5 times [2021-12-16 22:32:56,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:32:56,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127703902] [2021-12-16 22:32:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:32:56,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:32:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:32:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 22:32:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 22:33:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 22:33:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-16 22:33:01,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:33:01,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127703902] [2021-12-16 22:33:01,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127703902] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:33:01,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808120042] [2021-12-16 22:33:01,131 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 22:33:01,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:33:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:33:01,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:33:01,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-16 22:33:01,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-12-16 22:33:01,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 22:33:01,710 WARN L261 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 167 conjunts are in the unsatisfiable core [2021-12-16 22:33:01,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:33:01,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-16 22:33:01,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-16 22:33:01,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-16 22:33:02,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:02,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 22:33:02,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 544 treesize of output 225 [2021-12-16 22:33:03,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:03,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:03,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:03,773 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-16 22:33:03,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 343 treesize of output 157 [2021-12-16 22:33:04,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:04,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:04,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,067 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 22:33:04,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 319 treesize of output 160 [2021-12-16 22:33:04,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 22:33:04,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,353 INFO L354 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2021-12-16 22:33:04,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 305 treesize of output 160 [2021-12-16 22:33:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 22:33:04,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2021-12-16 22:33:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 22:33:04,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 22:33:04,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 134 [2021-12-16 22:33:11,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 22:33:11,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 669 treesize of output 269 [2021-12-16 22:33:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 286 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 22:33:12,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 22:33:27,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808120042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:33:27,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 22:33:27,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 53] total 74 [2021-12-16 22:33:27,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472992489] [2021-12-16 22:33:27,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 22:33:27,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2021-12-16 22:33:27,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:33:27,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-12-16 22:33:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=5455, Unknown=18, NotChecked=0, Total=5700 [2021-12-16 22:33:27,788 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 74 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 69 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 22:33:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:33:32,173 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2021-12-16 22:33:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-16 22:33:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 69 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 76 [2021-12-16 22:33:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:33:32,176 INFO L225 Difference]: With dead ends: 77 [2021-12-16 22:33:32,176 INFO L226 Difference]: Without dead ends: 73 [2021-12-16 22:33:32,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 41 SyntacticMatches, 29 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2293 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=292, Invalid=6830, Unknown=18, NotChecked=0, Total=7140 [2021-12-16 22:33:32,179 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 371 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-16 22:33:32,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 521 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2018 Invalid, 0 Unknown, 371 Unchecked, 2.8s Time] [2021-12-16 22:33:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-16 22:33:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-12-16 22:33:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2021-12-16 22:33:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2021-12-16 22:33:32,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 76 [2021-12-16 22:33:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:33:32,192 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2021-12-16 22:33:32,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 69 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-16 22:33:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2021-12-16 22:33:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-16 22:33:32,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:33:32,196 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:33:32,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-16 22:33:32,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-16 22:33:32,402 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:33:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:33:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1690977777, now seen corresponding path program 6 times [2021-12-16 22:33:32,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:33:32,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491011439] [2021-12-16 22:33:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:33:32,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:33:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 22:33:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 22:33:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-16 22:33:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-12-16 22:33:32,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:33:32,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491011439] [2021-12-16 22:33:32,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491011439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 22:33:32,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 22:33:32,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 22:33:32,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37473465] [2021-12-16 22:33:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 22:33:32,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 22:33:32,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:33:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 22:33:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 22:33:32,480 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 22:33:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:33:32,495 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2021-12-16 22:33:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 22:33:32,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2021-12-16 22:33:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:33:32,497 INFO L225 Difference]: With dead ends: 89 [2021-12-16 22:33:32,497 INFO L226 Difference]: Without dead ends: 49 [2021-12-16 22:33:32,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 22:33:32,501 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:33:32,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 63 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:33:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-16 22:33:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-12-16 22:33:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-16 22:33:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-16 22:33:32,512 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 78 [2021-12-16 22:33:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:33:32,512 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-16 22:33:32,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-16 22:33:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-16 22:33:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-16 22:33:32,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 22:33:32,514 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 22:33:32,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 22:33:32,514 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 22:33:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 22:33:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 624132497, now seen corresponding path program 7 times [2021-12-16 22:33:32,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 22:33:32,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101638404] [2021-12-16 22:33:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 22:33:32,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 22:33:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 22:33:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 22:33:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-16 22:33:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-16 22:33:32,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 22:33:32,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101638404] [2021-12-16 22:33:32,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101638404] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 22:33:32,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897659542] [2021-12-16 22:33:32,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 22:33:32,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 22:33:32,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 22:33:32,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 22:33:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 22:33:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 22:33:32,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 22:33:32,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 22:33:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2021-12-16 22:33:32,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 22:33:32,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897659542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 22:33:32,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 22:33:32,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-12-16 22:33:32,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374918750] [2021-12-16 22:33:32,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 22:33:32,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 22:33:32,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 22:33:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 22:33:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-16 22:33:32,765 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:33:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 22:33:32,778 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2021-12-16 22:33:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 22:33:32,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 78 [2021-12-16 22:33:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 22:33:32,779 INFO L225 Difference]: With dead ends: 64 [2021-12-16 22:33:32,779 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 22:33:32,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-16 22:33:32,781 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 22:33:32,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 22:33:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 22:33:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 22:33:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2021-12-16 22:33:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 22:33:32,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2021-12-16 22:33:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 22:33:32,783 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 22:33:32,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 22:33:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 22:33:32,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 22:33:32,785 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 22:33:32,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 22:33:32,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-16 22:33:33,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 22:33:33,619 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L861 garLoopResultBuilder]: At program point L52(lines 26 53) the Hoare annotation is: true [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (= 0 |ULTIMATE.start_main_~#x~0#1.offset|) [2021-12-16 22:33:33,620 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (= 0 |ULTIMATE.start_main_~#x~0#1.offset|) [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse5 (select .cse6 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse7 (select .cse6 0)) (.cse8 (select .cse6 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse9 (select .cse6 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12)))) (let ((.cse3 (+ .cse5 .cse7 |ULTIMATE.start_main_~temp~0#1| .cse8 .cse9)) (.cse1 (+ .cse5 (select .cse6 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16)) .cse7 .cse8 .cse9))) (let ((.cse0 (* 4294967296 (div .cse1 4294967296))) (.cse2 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse4 (* 4294967296 (div .cse3 4294967296)))) (and (or (<= (+ .cse0 2147483648) .cse1) (and .cse2 (= .cse1 (+ .cse0 |ULTIMATE.start_main_~ret~1#1|)))) (or (<= .cse3 (+ .cse4 2147483647)) (= .cse3 (+ .cse4 |ULTIMATE.start_main_~ret~1#1| 4294967296))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (or (<= .cse1 (+ .cse0 2147483647)) (and (= .cse1 (+ .cse0 |ULTIMATE.start_main_~ret~1#1| 4294967296)) .cse2)) (or (= .cse3 (+ .cse4 |ULTIMATE.start_main_~ret~1#1|)) (<= (+ .cse4 2147483648) .cse3))))))) [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse4 (select .cse8 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse3 (select .cse8 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse5 (select .cse8 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16))) (.cse6 (select .cse8 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse7 (select .cse8 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12)))) (let ((.cse1 (+ .cse4 .cse3 .cse5 .cse6 .cse7))) (let ((.cse0 (* 4294967296 (div .cse1 4294967296)))) (and (or (<= (+ .cse0 2147483648) .cse1) (= .cse1 (+ |ULTIMATE.start_main_~ret~1#1| .cse0))) (let ((.cse2 (+ .cse3 .cse4 .cse5 .cse6 .cse7))) (or (= .cse2 (+ |ULTIMATE.start_main_~ret~1#1| .cse0 4294967296)) (<= (* 4294967296 (div (+ .cse3 .cse4 .cse5 .cse6 .cse7 2147483648) 4294967296)) .cse2))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0)))))) [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 45) no Hoare annotation was computed. [2021-12-16 22:33:33,620 INFO L858 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2021-12-16 22:33:33,621 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse4 (select .cse18 (+ |ULTIMATE.start_main_~#x~0#1.offset| (* |ULTIMATE.start_main_~i~2#1| 4)))) (.cse2 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse5 (= |ULTIMATE.start_main_~#x~0#1.offset| 0)) (.cse7 (select .cse18 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse6 (select .cse18 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse8 (select .cse18 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16))) (.cse3 (select .cse18 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse9 (select .cse18 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12)))) (or (let ((.cse0 (+ .cse6 .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1| .cse9))) (let ((.cse1 (* 4294967296 (div .cse0 4294967296)))) (and (or (<= .cse0 (+ .cse1 2147483647)) (and .cse2 (= .cse0 (+ |ULTIMATE.start_main_~ret~1#1| .cse1 4294967296)))) (= .cse3 .cse4) (or (and .cse2 (= .cse0 (+ |ULTIMATE.start_main_~ret~1#1| .cse1))) (<= (+ .cse1 2147483648) .cse0)) .cse5 (= |ULTIMATE.start_main_~i~2#1| 3)))) (let ((.cse10 (+ .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1| .cse3 .cse9))) (let ((.cse11 (* 4294967296 (div .cse10 4294967296)))) (and (or (and .cse2 (= .cse10 (+ .cse11 |ULTIMATE.start_main_~ret~1#1| 4294967296))) (<= .cse10 (+ .cse11 2147483647))) (= |ULTIMATE.start_main_~i~2#1| 1) (= .cse4 .cse6) .cse5 (or (and .cse2 (= .cse10 (+ .cse11 |ULTIMATE.start_main_~ret~1#1|))) (<= (+ .cse11 2147483648) .cse10))))) (let ((.cse12 (+ .cse6 .cse8 |ULTIMATE.start_main_~temp~0#1| .cse3 .cse9))) (let ((.cse13 (* 4294967296 (div .cse12 4294967296)))) (and (or (and .cse2 (= .cse12 (+ .cse13 |ULTIMATE.start_main_~ret~1#1|))) (<= (+ .cse13 2147483648) .cse12)) (or (<= .cse12 (+ .cse13 2147483647)) (and .cse2 (= .cse12 (+ .cse13 |ULTIMATE.start_main_~ret~1#1| 4294967296)))) (= |ULTIMATE.start_main_~i~2#1| 2) (= .cse4 .cse7) .cse5))) (let ((.cse14 (+ .cse6 .cse7 |ULTIMATE.start_main_~temp~0#1| .cse3 .cse9))) (let ((.cse15 (* 4294967296 (div .cse14 4294967296)))) (and (= .cse8 .cse9) .cse5 (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (and .cse2 (= .cse14 (+ |ULTIMATE.start_main_~ret~1#1| .cse15 4294967296))) (<= .cse14 (+ .cse15 2147483647))) (or (<= (+ .cse15 2147483648) .cse14) (and .cse2 (= .cse14 (+ |ULTIMATE.start_main_~ret~1#1| .cse15))))))) (let ((.cse16 (+ .cse7 .cse6 .cse8 .cse3 .cse9))) (let ((.cse17 (* 4294967296 (div .cse16 4294967296)))) (and (or (and .cse2 (= .cse16 (+ |ULTIMATE.start_main_~ret~1#1| .cse17 4294967296))) (<= .cse16 (+ .cse17 2147483647))) (= |ULTIMATE.start_main_~temp~0#1| .cse6) (or (and .cse2 (= .cse16 (+ |ULTIMATE.start_main_~ret~1#1| .cse17))) (<= (+ .cse17 2147483648) .cse16)) .cse5 (= |ULTIMATE.start_main_~i~2#1| 0))))))) [2021-12-16 22:33:33,621 INFO L858 garLoopResultBuilder]: For program point L43-4(lines 43 45) no Hoare annotation was computed. [2021-12-16 22:33:33,621 INFO L858 garLoopResultBuilder]: For program point sumEXIT(lines 15 24) no Hoare annotation was computed. [2021-12-16 22:33:33,621 INFO L861 garLoopResultBuilder]: At program point sumENTRY(lines 15 24) the Hoare annotation is: true [2021-12-16 22:33:33,621 INFO L858 garLoopResultBuilder]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2021-12-16 22:33:33,621 INFO L854 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse7 (select |#memory_int| sum_~x.base))) (let ((.cse8 (select .cse7 |sum_#in~x.offset|)) (.cse2 (= |sum_#in~x.base| sum_~x.base)) (.cse4 (= |sum_#in~x.offset| sum_~x.offset))) (or (and (exists ((v_sum_~i~0_82 Int)) (and (= sum_~ret~0 (let ((.cse0 (select |#memory_int| |sum_#in~x.base|)) (.cse1 (* v_sum_~i~0_82 4))) (+ (select .cse0 (+ .cse1 |sum_#in~x.offset| (- 4))) (select .cse0 (+ .cse1 |sum_#in~x.offset|)) (select .cse0 (+ .cse1 |sum_#in~x.offset| (- 8))) (select .cse0 (+ .cse1 |sum_#in~x.offset| (- 16))) (select .cse0 (+ .cse1 |sum_#in~x.offset| (- 12)))))) (<= sum_~i~0 (+ v_sum_~i~0_82 1)) (< v_sum_~i~0_82 5))) (<= 5 sum_~i~0)) (and .cse2 (exists ((v_sum_~i~0_87 Int) (v_sum_~i~0_88 Int) (v_sum_~i~0_89 Int)) (and (<= (+ v_sum_~i~0_89 1) sum_~i~0) (<= (+ v_sum_~i~0_87 1) v_sum_~i~0_88) (= sum_~ret~0 (let ((.cse3 (select |#memory_int| sum_~x.base))) (+ (select .cse3 (+ sum_~x.offset (* v_sum_~i~0_89 4))) (select .cse3 (+ sum_~x.offset (* v_sum_~i~0_88 4))) (select .cse3 (+ sum_~x.offset (* v_sum_~i~0_87 4)))))) (<= (+ v_sum_~i~0_88 1) v_sum_~i~0_89) (<= 0 v_sum_~i~0_87))) .cse4 (<= sum_~i~0 3)) (and (exists ((v_sum_~i~0_90 Int) (v_sum_~i~0_87 Int) (v_sum_~i~0_88 Int) (v_sum_~i~0_89 Int)) (and (<= (+ v_sum_~i~0_89 1) v_sum_~i~0_90) (<= (+ v_sum_~i~0_87 1) v_sum_~i~0_88) (<= (+ v_sum_~i~0_90 1) sum_~i~0) (<= (+ v_sum_~i~0_88 1) v_sum_~i~0_89) (= sum_~ret~0 (let ((.cse5 (select |#memory_int| sum_~x.base))) (+ (select .cse5 (+ sum_~x.offset (* v_sum_~i~0_89 4))) (select .cse5 (+ sum_~x.offset (* v_sum_~i~0_90 4))) (select .cse5 (+ sum_~x.offset (* v_sum_~i~0_88 4))) (select .cse5 (+ sum_~x.offset (* v_sum_~i~0_87 4)))))) (<= 0 v_sum_~i~0_87))) .cse2 (<= sum_~i~0 4) .cse4) (and (<= 0 sum_~ret~0) (<= 0 sum_~i~0) (<= sum_~i~0 0) .cse2 (<= sum_~ret~0 0) .cse4) (let ((.cse6 (+ (select .cse7 (+ sum_~x.offset 4)) .cse8))) (and (<= sum_~i~0 2) (<= .cse6 sum_~ret~0) (<= sum_~ret~0 .cse6) (<= 2 sum_~i~0) .cse2 .cse4)) (and (<= sum_~ret~0 .cse8) (<= .cse8 sum_~ret~0) (<= 1 sum_~i~0) .cse2 .cse4 (<= sum_~i~0 1))))) [2021-12-16 22:33:33,621 INFO L858 garLoopResultBuilder]: For program point L20-4(lines 20 22) no Hoare annotation was computed. [2021-12-16 22:33:33,621 INFO L858 garLoopResultBuilder]: For program point sumFINAL(lines 15 24) no Hoare annotation was computed. [2021-12-16 22:33:33,623 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2021-12-16 22:33:33,624 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 22:33:33,631 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,641 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:33:33 BoogieIcfgContainer [2021-12-16 22:33:33,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 22:33:33,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 22:33:33,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 22:33:33,668 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 22:33:33,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:32:53" (3/4) ... [2021-12-16 22:33:33,670 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 22:33:33,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2021-12-16 22:33:33,680 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-16 22:33:33,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 22:33:33,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 22:33:33,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 22:33:33,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists v_sum_~i~0_82 : int :: (ret == unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -8] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -16] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -12] && i <= v_sum_~i~0_82 + 1) && v_sum_~i~0_82 < 5) && 5 <= i) || (((x == x && (\exists v_sum_~i~0_87 : int, v_sum_~i~0_88 : int, v_sum_~i~0_89 : int :: (((v_sum_~i~0_89 + 1 <= i && v_sum_~i~0_87 + 1 <= v_sum_~i~0_88) && ret == unknown-#memory_int-unknown[x][x + v_sum_~i~0_89 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_88 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_87 * 4]) && v_sum_~i~0_88 + 1 <= v_sum_~i~0_89) && 0 <= v_sum_~i~0_87)) && x == x) && i <= 3)) || ((((\exists v_sum_~i~0_90 : int, v_sum_~i~0_87 : int, v_sum_~i~0_88 : int, v_sum_~i~0_89 : int :: ((((v_sum_~i~0_89 + 1 <= v_sum_~i~0_90 && v_sum_~i~0_87 + 1 <= v_sum_~i~0_88) && v_sum_~i~0_90 + 1 <= i) && v_sum_~i~0_88 + 1 <= v_sum_~i~0_89) && ret == unknown-#memory_int-unknown[x][x + v_sum_~i~0_89 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_90 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_88 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_87 * 4]) && 0 <= v_sum_~i~0_87) && x == x) && i <= 4) && x == x)) || (((((0 <= ret && 0 <= i) && i <= 0) && x == x) && ret <= 0) && x == x)) || (((((i <= 2 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) && 2 <= i) && x == x) && x == x)) || (((((ret <= unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x] <= ret) && 1 <= i) && x == x) && x == x) && i <= 1) [2021-12-16 22:33:33,715 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 22:33:33,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 22:33:33,716 INFO L158 Benchmark]: Toolchain (without parser) took 41192.13ms. Allocated memory was 94.4MB in the beginning and 167.8MB in the end (delta: 73.4MB). Free memory was 62.5MB in the beginning and 58.8MB in the end (delta: 3.7MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,716 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.3MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 22:33:33,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.5MB in the beginning and 88.9MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.38ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,718 INFO L158 Benchmark]: Boogie Preprocessor took 24.50ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,718 INFO L158 Benchmark]: RCFGBuilder took 251.31ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 75.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,719 INFO L158 Benchmark]: TraceAbstraction took 40659.52ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 63.0MB in the end (delta: 12.0MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,720 INFO L158 Benchmark]: Witness Printer took 47.86ms. Allocated memory is still 167.8MB. Free memory was 63.0MB in the beginning and 58.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 22:33:33,722 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.20ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 51.3MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.5MB in the beginning and 88.9MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.38ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.50ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 251.31ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 75.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40659.52ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 63.0MB in the end (delta: 12.0MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. * Witness Printer took 47.86ms. Allocated memory is still 167.8MB. Free memory was 63.0MB in the beginning and 58.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 371 IncrementalHoareTripleChecker+Unchecked, 904 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2164 IncrementalHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 223 mSDtfsCounter, 2164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 848 GetRequests, 686 SyntacticMatches, 32 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=8, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 48 PreInvPairs, 80 NumberOfFragments, 2660 HoareAnnotationTreeSize, 48 FomulaSimplifications, 117 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 447 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1193 ConstructedInterpolants, 8 QuantifiedInterpolants, 20006 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 2532/3239 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,748 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_82,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_89,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_90,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_88,QUANTIFIED] [2021-12-16 22:33:33,751 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] [2021-12-16 22:33:33,752 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_87,QUANTIFIED] Derived loop invariant: ((((((\exists v_sum_~i~0_82 : int :: (ret == unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -8] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -16] + unknown-#memory_int-unknown[x][v_sum_~i~0_82 * 4 + x + -12] && i <= v_sum_~i~0_82 + 1) && v_sum_~i~0_82 < 5) && 5 <= i) || (((x == x && (\exists v_sum_~i~0_87 : int, v_sum_~i~0_88 : int, v_sum_~i~0_89 : int :: (((v_sum_~i~0_89 + 1 <= i && v_sum_~i~0_87 + 1 <= v_sum_~i~0_88) && ret == unknown-#memory_int-unknown[x][x + v_sum_~i~0_89 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_88 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_87 * 4]) && v_sum_~i~0_88 + 1 <= v_sum_~i~0_89) && 0 <= v_sum_~i~0_87)) && x == x) && i <= 3)) || ((((\exists v_sum_~i~0_90 : int, v_sum_~i~0_87 : int, v_sum_~i~0_88 : int, v_sum_~i~0_89 : int :: ((((v_sum_~i~0_89 + 1 <= v_sum_~i~0_90 && v_sum_~i~0_87 + 1 <= v_sum_~i~0_88) && v_sum_~i~0_90 + 1 <= i) && v_sum_~i~0_88 + 1 <= v_sum_~i~0_89) && ret == unknown-#memory_int-unknown[x][x + v_sum_~i~0_89 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_90 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_88 * 4] + unknown-#memory_int-unknown[x][x + v_sum_~i~0_87 * 4]) && 0 <= v_sum_~i~0_87) && x == x) && i <= 4) && x == x)) || (((((0 <= ret && 0 <= i) && i <= 0) && x == x) && ret <= 0) && x == x)) || (((((i <= 2 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) && 2 <= i) && x == x) && x == x)) || (((((ret <= unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x] <= ret) && 1 <= i) && x == x) && x == x) && i <= 1) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647 || (ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296)) && unknown-#memory_int-unknown[x][x + 8] == unknown-#memory_int-unknown[x][x + i * 4]) && ((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296)) || 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483648 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12])) && x == 0) && i == 3) || ((((((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret + 4294967296) || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647) && i == 1) && unknown-#memory_int-unknown[x][x + i * 4] == unknown-#memory_int-unknown[x][x]) && x == 0) && ((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret) || 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483648 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]))) || ((((((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret) || 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483648 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) && (unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647 || (ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret + 4294967296))) && i == 2) && unknown-#memory_int-unknown[x][x + i * 4] == unknown-#memory_int-unknown[x][x + 4]) && x == 0)) || ((((unknown-#memory_int-unknown[x][x + 16] == unknown-#memory_int-unknown[x][x + 12] && x == 0) && 4 <= i) && ((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296) || unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647)) && (4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483648 <= unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] || (ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296))))) || ((((((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296) || unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647) && temp == unknown-#memory_int-unknown[x][x]) && ((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296)) || 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483648 <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12])) && x == 0) && i == 0) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 == x RESULT: Ultimate proved your program to be correct! [2021-12-16 22:33:33,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE