./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test24-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ldv-regression/test24-1.c -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 043660dc5a969bbd34b12cbb93ba3e467b4f8613 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:58:40,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:58:40,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:58:40,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:58:40,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:58:40,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:58:40,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:58:40,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:58:40,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:58:40,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:58:40,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:58:40,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:58:40,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:58:40,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:58:40,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:58:40,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:58:40,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:58:40,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:58:40,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:58:40,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:58:40,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:58:40,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:58:40,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:58:40,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:58:40,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:58:40,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:58:40,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:58:40,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:58:40,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:58:40,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:58:40,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:58:40,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:58:40,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:58:40,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:58:40,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:58:40,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:58:40,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:58:40,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:58:40,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:58:40,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:58:40,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:58:40,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:58:40,218 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:58:40,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:58:40,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:58:40,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:58:40,220 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:58:40,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:58:40,220 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:58:40,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:58:40,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:58:40,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:58:40,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:58:40,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:58:40,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:58:40,222 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:58:40,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:58:40,222 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:58:40,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:58:40,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:58:40,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:58:40,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:58:40,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:58:40,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:58:40,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:58:40,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:58:40,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:58:40,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:58:40,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:58:40,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:58:40,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:58:40,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 043660dc5a969bbd34b12cbb93ba3e467b4f8613 [2020-07-28 17:58:40,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:58:40,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:58:40,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:58:40,541 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:58:40,542 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:58:40,542 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-1.c [2020-07-28 17:58:40,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ced9e6b/4ca3b1190c2947b9a31df959e5597e3b/FLAG0b85d25b0 [2020-07-28 17:58:41,021 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:58:41,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-1.c [2020-07-28 17:58:41,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ced9e6b/4ca3b1190c2947b9a31df959e5597e3b/FLAG0b85d25b0 [2020-07-28 17:58:41,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ced9e6b/4ca3b1190c2947b9a31df959e5597e3b [2020-07-28 17:58:41,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:58:41,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:58:41,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:41,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:58:41,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:58:41,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0f9a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41, skipping insertion in model container [2020-07-28 17:58:41,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:58:41,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:58:41,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:41,709 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:58:41,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:58:41,743 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:58:41,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41 WrapperNode [2020-07-28 17:58:41,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:58:41,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:41,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:58:41,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:58:41,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:58:41,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:58:41,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:58:41,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:58:41,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... [2020-07-28 17:58:41,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:58:41,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:58:41,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:58:41,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:58:41,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:58:41,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:58:41,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:58:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:58:41,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:58:41,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:58:41,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:58:42,217 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:58:42,217 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 17:58:42,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:42 BoogieIcfgContainer [2020-07-28 17:58:42,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:58:42,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:58:42,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:58:42,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:58:42,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:58:41" (1/3) ... [2020-07-28 17:58:42,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a57fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:42, skipping insertion in model container [2020-07-28 17:58:42,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:58:41" (2/3) ... [2020-07-28 17:58:42,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a57fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:58:42, skipping insertion in model container [2020-07-28 17:58:42,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:42" (3/3) ... [2020-07-28 17:58:42,230 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-1.c [2020-07-28 17:58:42,241 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:58:42,249 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:58:42,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:58:42,301 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:58:42,301 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:58:42,301 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:58:42,302 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:58:42,302 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:58:42,302 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:58:42,302 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:58:42,303 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:58:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-07-28 17:58:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 17:58:42,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:42,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:42,323 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:42,328 INFO L82 PathProgramCache]: Analyzing trace with hash 126985497, now seen corresponding path program 1 times [2020-07-28 17:58:42,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:42,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914816493] [2020-07-28 17:58:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:42,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {17#true} is VALID [2020-07-28 17:58:42,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {17#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {17#true} is VALID [2020-07-28 17:58:42,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {17#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {17#true} is VALID [2020-07-28 17:58:42,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#true} assume !true; {18#false} is VALID [2020-07-28 17:58:42,496 INFO L280 TraceCheckUtils]: 4: Hoare triple {18#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {18#false} is VALID [2020-07-28 17:58:42,496 INFO L280 TraceCheckUtils]: 5: Hoare triple {18#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {18#false} is VALID [2020-07-28 17:58:42,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {18#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {18#false} is VALID [2020-07-28 17:58:42,497 INFO L280 TraceCheckUtils]: 7: Hoare triple {18#false} assume !false; {18#false} is VALID [2020-07-28 17:58:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:42,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914816493] [2020-07-28 17:58:42,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:42,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:58:42,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994950370] [2020-07-28 17:58:42,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-07-28 17:58:42,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:42,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:58:42,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:42,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:58:42,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:58:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:58:42,556 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-07-28 17:58:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:42,601 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-28 17:58:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:58:42,602 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-07-28 17:58:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:58:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 17:58:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:58:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2020-07-28 17:58:42,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2020-07-28 17:58:42,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:42,705 INFO L225 Difference]: With dead ends: 23 [2020-07-28 17:58:42,705 INFO L226 Difference]: Without dead ends: 10 [2020-07-28 17:58:42,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:58:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-28 17:58:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-28 17:58:42,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:42,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2020-07-28 17:58:42,752 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 17:58:42,752 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 17:58:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:42,757 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 17:58:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 17:58:42,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:42,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:42,759 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 17:58:42,759 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 17:58:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:42,762 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 17:58:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 17:58:42,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:42,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:42,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:42,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:58:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-07-28 17:58:42,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-07-28 17:58:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:42,770 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-07-28 17:58:42,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:58:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 17:58:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:58:42,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:42,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:42,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:58:42,772 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash -564424753, now seen corresponding path program 1 times [2020-07-28 17:58:42,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:42,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973998403] [2020-07-28 17:58:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:42,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {84#true} is VALID [2020-07-28 17:58:42,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {84#true} is VALID [2020-07-28 17:58:42,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {86#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:42,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {87#(<= (+ ULTIMATE.start_main_~i~0 1) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:58:42,955 INFO L280 TraceCheckUtils]: 4: Hoare triple {87#(<= (+ ULTIMATE.start_main_~i~0 1) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {85#false} is VALID [2020-07-28 17:58:42,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {85#false} is VALID [2020-07-28 17:58:42,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {85#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {85#false} is VALID [2020-07-28 17:58:42,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {85#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {85#false} is VALID [2020-07-28 17:58:42,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#false} assume !false; {85#false} is VALID [2020-07-28 17:58:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:42,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973998403] [2020-07-28 17:58:42,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:58:42,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:58:42,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664678459] [2020-07-28 17:58:42,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 17:58:42,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:42,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:58:42,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:42,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:58:42,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:58:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:58:42,979 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 4 states. [2020-07-28 17:58:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:43,057 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 17:58:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:58:43,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-28 17:58:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:58:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 17:58:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:58:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-28 17:58:43,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2020-07-28 17:58:43,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:43,094 INFO L225 Difference]: With dead ends: 17 [2020-07-28 17:58:43,095 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 17:58:43,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:58:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 17:58:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 17:58:43,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:43,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 17:58:43,102 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 17:58:43,102 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 17:58:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:43,104 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 17:58:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 17:58:43,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:43,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:43,105 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 17:58:43,105 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 17:58:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:43,106 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-28 17:58:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 17:58:43,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:43,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:43,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:43,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 17:58:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-28 17:58:43,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2020-07-28 17:58:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:43,109 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-28 17:58:43,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:58:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-28 17:58:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:58:43,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:43,111 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:43,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:58:43,111 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:43,112 INFO L82 PathProgramCache]: Analyzing trace with hash 263489748, now seen corresponding path program 1 times [2020-07-28 17:58:43,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:43,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033983986] [2020-07-28 17:58:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:43,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-28 17:58:43,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {155#true} is VALID [2020-07-28 17:58:43,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {157#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:43,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {157#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {157#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:43,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {157#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {158#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:43,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {158#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {159#(<= (+ ULTIMATE.start_main_~i~0 9) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:58:43,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {159#(<= (+ ULTIMATE.start_main_~i~0 9) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {156#false} is VALID [2020-07-28 17:58:43,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {156#false} is VALID [2020-07-28 17:58:43,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {156#false} is VALID [2020-07-28 17:58:43,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {156#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {156#false} is VALID [2020-07-28 17:58:43,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-28 17:58:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:43,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033983986] [2020-07-28 17:58:43,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882178887] [2020-07-28 17:58:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:43,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 17:58:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:43,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:48,849 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-28 17:58:48,857 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:48,859 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2020-07-28 17:58:48,887 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 17:58:48,896 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:48,933 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:58:48,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2020-07-28 17:58:48,939 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:58:48,940 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~pa~0.base, ULTIMATE.start_main_~pa~0.offset, ULTIMATE.start_main_~ad2~0.offset]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_~pa~0.base))) (and (<= (select .cse0 ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_#t~mem3|) (<= (+ ULTIMATE.start_main_~i~0 9) (select .cse0 (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))))) [2020-07-28 17:58:48,940 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ ULTIMATE.start_main_~i~0 9) |ULTIMATE.start_main_#t~mem3|) [2020-07-28 17:58:49,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-28 17:58:49,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {155#true} is VALID [2020-07-28 17:58:49,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {169#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} is VALID [2020-07-28 17:58:49,050 INFO L280 TraceCheckUtils]: 3: Hoare triple {169#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {169#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} is VALID [2020-07-28 17:58:49,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {169#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {176#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} is VALID [2020-07-28 17:58:49,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {176#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {159#(<= (+ ULTIMATE.start_main_~i~0 9) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:58:49,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {159#(<= (+ ULTIMATE.start_main_~i~0 9) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {156#false} is VALID [2020-07-28 17:58:49,057 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {156#false} is VALID [2020-07-28 17:58:49,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {156#false} is VALID [2020-07-28 17:58:49,058 INFO L280 TraceCheckUtils]: 9: Hoare triple {156#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {156#false} is VALID [2020-07-28 17:58:49,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-28 17:58:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:49,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:49,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-28 17:58:49,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840857119] [2020-07-28 17:58:49,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-28 17:58:49,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:49,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:58:49,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:49,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:58:49,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:58:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=23, Unknown=2, NotChecked=0, Total=42 [2020-07-28 17:58:49,146 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2020-07-28 17:58:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,046 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-28 17:58:52,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:58:52,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-28 17:58:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-28 17:58:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2020-07-28 17:58:52,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2020-07-28 17:58:52,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:52,116 INFO L225 Difference]: With dead ends: 19 [2020-07-28 17:58:52,116 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 17:58:52,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=30, Invalid=40, Unknown=2, NotChecked=0, Total=72 [2020-07-28 17:58:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 17:58:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 17:58:52,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:58:52,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 17:58:52,133 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 17:58:52,133 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 17:58:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,134 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 17:58:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 17:58:52,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:52,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:52,136 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 17:58:52,137 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 17:58:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:52,138 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 17:58:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 17:58:52,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:58:52,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:58:52,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:58:52,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:58:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:58:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-28 17:58:52,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2020-07-28 17:58:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:58:52,142 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-28 17:58:52,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:58:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-28 17:58:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:58:52,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:58:52,143 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:58:52,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 17:58:52,356 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:58:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:58:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1320375449, now seen corresponding path program 2 times [2020-07-28 17:58:52,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:58:52,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086088353] [2020-07-28 17:58:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:58:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:52,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {271#true} is VALID [2020-07-28 17:58:52,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {271#true} is VALID [2020-07-28 17:58:52,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {271#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {273#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:52,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {273#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {273#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:52,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {273#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:52,497 INFO L280 TraceCheckUtils]: 5: Hoare triple {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:52,499 INFO L280 TraceCheckUtils]: 6: Hoare triple {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {275#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:52,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {275#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {276#(<= (+ ULTIMATE.start_main_~i~0 8) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:58:52,500 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#(<= (+ ULTIMATE.start_main_~i~0 8) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {272#false} is VALID [2020-07-28 17:58:52,501 INFO L280 TraceCheckUtils]: 9: Hoare triple {272#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {272#false} is VALID [2020-07-28 17:58:52,501 INFO L280 TraceCheckUtils]: 10: Hoare triple {272#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {272#false} is VALID [2020-07-28 17:58:52,501 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {272#false} is VALID [2020-07-28 17:58:52,502 INFO L280 TraceCheckUtils]: 12: Hoare triple {272#false} assume !false; {272#false} is VALID [2020-07-28 17:58:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:52,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086088353] [2020-07-28 17:58:52,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558602136] [2020-07-28 17:58:52,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:58:52,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 17:58:52,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 17:58:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 17:58:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:58:52,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:58:57,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-28 17:58:57,158 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 17:58:57,161 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:58:57,162 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:58:57,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-07-28 17:58:57,165 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:58:57,165 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~pa~0.base, ULTIMATE.start_main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (and (<= .cse0 |ULTIMATE.start_main_#t~mem3|) (<= (+ ULTIMATE.start_main_~i~0 8) .cse0))) [2020-07-28 17:58:57,165 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ ULTIMATE.start_main_~i~0 8) |ULTIMATE.start_main_#t~mem3|) [2020-07-28 17:58:57,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {271#true} is VALID [2020-07-28 17:58:57,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {271#true} is VALID [2020-07-28 17:58:59,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {271#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {286#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} is UNKNOWN [2020-07-28 17:58:59,243 INFO L280 TraceCheckUtils]: 3: Hoare triple {286#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {286#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} is VALID [2020-07-28 17:58:59,245 INFO L280 TraceCheckUtils]: 4: Hoare triple {286#(exists ((ULTIMATE.start_main_~ad2~0.offset Int)) (and (<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) (+ (* (div (+ (* ULTIMATE.start_main_~pa~0.offset (- 1)) ULTIMATE.start_main_~ad2~0.offset) (- 8)) 8) ULTIMATE.start_main_~ad2~0.offset))) (= 0 (mod (+ ULTIMATE.start_main_~ad2~0.offset (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8)))))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:59,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:59,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {274#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {275#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:58:59,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {275#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {276#(<= (+ ULTIMATE.start_main_~i~0 8) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:58:59,255 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#(<= (+ ULTIMATE.start_main_~i~0 8) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {272#false} is VALID [2020-07-28 17:58:59,256 INFO L280 TraceCheckUtils]: 9: Hoare triple {272#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {272#false} is VALID [2020-07-28 17:58:59,256 INFO L280 TraceCheckUtils]: 10: Hoare triple {272#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {272#false} is VALID [2020-07-28 17:58:59,256 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {272#false} is VALID [2020-07-28 17:58:59,257 INFO L280 TraceCheckUtils]: 12: Hoare triple {272#false} assume !false; {272#false} is VALID [2020-07-28 17:58:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:58:59,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:58:59,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-28 17:58:59,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720373530] [2020-07-28 17:58:59,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-28 17:58:59,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:58:59,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:58:59,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:58:59,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:58:59,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:58:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:58:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2020-07-28 17:58:59,500 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2020-07-28 17:58:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:58:59,672 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-28 17:58:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 17:58:59,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-28 17:58:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:58:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2020-07-28 17:58:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:58:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2020-07-28 17:58:59,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2020-07-28 17:59:01,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:01,802 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:59:01,802 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:59:01,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2020-07-28 17:59:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:59:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:59:01,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:01,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:59:01,830 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:59:01,831 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:59:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:01,832 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:59:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:59:01,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:01,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:01,833 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:59:01,836 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:59:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:01,838 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:59:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:59:01,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:01,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:01,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:01,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:59:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:59:01,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2020-07-28 17:59:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:01,842 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:59:01,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:59:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:59:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:59:01,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:01,843 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:02,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:59:02,046 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -919715042, now seen corresponding path program 3 times [2020-07-28 17:59:02,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:02,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299643033] [2020-07-28 17:59:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:02,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2020-07-28 17:59:02,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {405#true} is VALID [2020-07-28 17:59:02,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {407#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {407#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {407#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#(<= (+ ULTIMATE.start_main_~i~0 10) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {408#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,173 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {408#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= (+ ULTIMATE.start_main_~i~0 9) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {409#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {409#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {409#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#(<= (+ ULTIMATE.start_main_~i~0 8) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {410#(<= (+ ULTIMATE.start_main_~i~0 7) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} is VALID [2020-07-28 17:59:02,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {410#(<= (+ ULTIMATE.start_main_~i~0 7) (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {411#(<= (+ ULTIMATE.start_main_~i~0 7) |ULTIMATE.start_main_#t~mem3|)} is VALID [2020-07-28 17:59:02,177 INFO L280 TraceCheckUtils]: 10: Hoare triple {411#(<= (+ ULTIMATE.start_main_~i~0 7) |ULTIMATE.start_main_#t~mem3|)} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {406#false} is VALID [2020-07-28 17:59:02,177 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {406#false} is VALID [2020-07-28 17:59:02,177 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {406#false} is VALID [2020-07-28 17:59:02,178 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume 0 == main_#t~ret5;havoc main_#t~ret5; {406#false} is VALID [2020-07-28 17:59:02,178 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 17:59:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:02,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299643033] [2020-07-28 17:59:02,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106962458] [2020-07-28 17:59:02,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:59:02,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 17:59:02,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 17:59:02,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-28 17:59:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:02,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:59:02,275 INFO L384 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 25 treesize of output 21 [2020-07-28 17:59:02,276 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-28 17:59:02,294 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:59:02,295 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:59:02,295 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-07-28 17:59:08,112 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:59:08,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {405#true} is VALID [2020-07-28 17:59:08,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~pre4, main_#t~mem3, main_#t~ret5, main_~#ad1~0.base, main_~#ad1~0.offset, main_~ad2~0.base, main_~ad2~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#ad1~0.base, main_~#ad1~0.offset := #Ultimate.allocOnStack(80);havoc main_~ad2~0.base, main_~ad2~0.offset;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~i~0 := main_#t~nondet1;havoc main_#t~nondet1; {405#true} is VALID [2020-07-28 17:59:08,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#true} assume main_~i~0 >= 0 && main_~i~0 < 10;main_~ad2~0.base, main_~ad2~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset;call write~int(main_~i~0, main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0, 4);main_~pa~0.base, main_~pa~0.offset := main_~#ad1~0.base, main_~#ad1~0.offset + 8 * main_~i~0;call main_#t~mem2 := read~int(main_~ad2~0.base, main_~ad2~0.offset + 8 * main_~i~0, 4);main_~i~0 := main_#t~mem2 - 10;havoc main_#t~mem2; {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {421#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {437#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= |ULTIMATE.start_main_#t~mem3| (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {437#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= |ULTIMATE.start_main_#t~mem3| (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} assume !!(main_~i~0 < main_#t~mem3);havoc main_#t~mem3;main_#t~pre4 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre4; {441#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} is VALID [2020-07-28 17:59:08,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {441#(and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|))} call main_#t~mem3 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); {445#(exists ((ULTIMATE.start_main_~pa~0.offset Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_#t~mem3|) (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8))))))} is VALID [2020-07-28 17:59:08,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#(exists ((ULTIMATE.start_main_~pa~0.offset Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset) |ULTIMATE.start_main_#t~mem3|) (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8))))))} assume !(main_~i~0 < main_#t~mem3);havoc main_#t~mem3; {449#(exists ((ULTIMATE.start_main_~pa~0.offset Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset) ULTIMATE.start_main_~i~0) (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8))))))} is VALID [2020-07-28 17:59:08,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#(exists ((ULTIMATE.start_main_~pa~0.offset Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset) ULTIMATE.start_main_~i~0) (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) ULTIMATE.start_main_~pa~0.offset)) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8))))))} check_#in~ad1.base, check_#in~ad1.offset, check_#in~b := main_~#ad1~0.base, main_~#ad1~0.offset, main_~i~0;havoc check_#res;havoc check_#t~mem0, check_~ad1.base, check_~ad1.offset, check_~b;check_~ad1.base, check_~ad1.offset := check_#in~ad1.base, check_#in~ad1.offset;check_~b := check_#in~b;call check_#t~mem0 := read~int(check_~ad1.base, check_~ad1.offset + 8 * check_~b, 4);check_#res := (if check_#t~mem0 == check_~b then 1 else 0);havoc check_#t~mem0; {453#(<= 1 |ULTIMATE.start_check_#res|)} is VALID [2020-07-28 17:59:09,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {453#(<= 1 |ULTIMATE.start_check_#res|)} main_#t~ret5 := check_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; {457#(<= 1 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 17:59:09,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {457#(<= 1 |ULTIMATE.start_main_#t~ret5|)} assume 0 == main_#t~ret5;havoc main_#t~ret5; {406#false} is VALID [2020-07-28 17:59:09,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 17:59:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 17:59:09,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 17:59:09,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-07-28 17:59:09,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378804101] [2020-07-28 17:59:09,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-07-28 17:59:09,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:09,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 17:59:09,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:09,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 17:59:09,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 17:59:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-28 17:59:09,056 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2020-07-28 17:59:12,025 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-07-28 17:59:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:13,111 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:59:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-28 17:59:13,111 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-07-28 17:59:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:59:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2020-07-28 17:59:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 17:59:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2020-07-28 17:59:13,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 22 transitions. [2020-07-28 17:59:13,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:13,180 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:59:13,180 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:59:13,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2020-07-28 17:59:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:59:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:59:13,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:13,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:59:13,182 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:59:13,183 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:59:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:13,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:59:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:59:13,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:13,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:13,184 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:59:13,184 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:59:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:13,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:59:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:59:13,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:13,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:13,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:13,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:59:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:59:13,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 17:59:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:13,185 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:59:13,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 17:59:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:59:13,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:13,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:59:13,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:59:13,547 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:59:13,547 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-28 17:59:13,547 INFO L268 CegarLoopResult]: For program point L21(lines 21 32) no Hoare annotation was computed. [2020-07-28 17:59:13,547 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2020-07-28 17:59:13,548 INFO L264 CegarLoopResult]: At program point L11(lines 9 12) the Hoare annotation is: (and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (exists ((ULTIMATE.start_main_~pa~0.offset Int)) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|))) (let ((.cse0 (select .cse1 ULTIMATE.start_main_~pa~0.offset))) (and (<= .cse0 ULTIMATE.start_main_~i~0) (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 .cse0) (= (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)) (select .cse1 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (- ULTIMATE.start_main_~pa~0.offset)) (- 8)) 8)))))))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|) (<= 1 |ULTIMATE.start_check_#res|)) [2020-07-28 17:59:13,548 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:59:13,548 INFO L264 CegarLoopResult]: At program point L30(lines 15 38) the Hoare annotation is: false [2020-07-28 17:59:13,548 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:59:13,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:59:13,549 INFO L268 CegarLoopResult]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2020-07-28 17:59:13,549 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2020-07-28 17:59:13,549 INFO L264 CegarLoopResult]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (= 0 (mod (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset 7)) (- 8))) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (let ((.cse0 (div (+ |ULTIMATE.start_main_~#ad1~0.offset| (* ULTIMATE.start_main_~pa~0.offset (- 1))) (- 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* .cse0 8))) .cse0)) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|)) [2020-07-28 17:59:13,549 INFO L268 CegarLoopResult]: For program point L26-4(lines 26 28) no Hoare annotation was computed. [2020-07-28 17:59:13,549 INFO L271 CegarLoopResult]: At program point L37(lines 14 38) the Hoare annotation is: true [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-28 17:59:13,554 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: L26-4 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:59:13,555 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:59:13,556 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:59:13,556 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:59:13,556 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-28 17:59:13,556 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:59:13,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,571 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,572 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,584 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:59:13 BoogieIcfgContainer [2020-07-28 17:59:13,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:59:13,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:59:13,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:59:13,587 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:59:13,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:58:42" (3/4) ... [2020-07-28 17:59:13,591 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:59:13,602 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 17:59:13,603 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 17:59:13,603 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:59:13,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == (ad1 + pa * 7) % -8 && (ad1 + pa * -1) / -8 == unknown-#memory_int-unknown[ad1][ad1 + (ad1 + -pa) / -8 * 8]) && i <= unknown-#memory_int-unknown[pa][pa]) && (\exists ULTIMATE.start_main_~pa~0.offset : int :: ((unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset] <= i && 0 == (ad1 + ULTIMATE.start_main_~pa~0.offset * 7) % -8) && i <= unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset]) && (ad1 + ULTIMATE.start_main_~pa~0.offset * -1) / -8 == unknown-#memory_int-unknown[ad1][ad1 + (ad1 + -ULTIMATE.start_main_~pa~0.offset) / -8 * 8])) && pa == ad1) && 1 <= \result [2020-07-28 17:59:13,659 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:59:13,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:59:13,661 INFO L168 Benchmark]: Toolchain (without parser) took 32231.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 956.2 MB in the beginning and 843.1 MB in the end (delta: 113.1 MB). Peak memory consumption was 311.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,661 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:59:13,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.72 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,663 INFO L168 Benchmark]: Boogie Preprocessor took 23.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:59:13,664 INFO L168 Benchmark]: RCFGBuilder took 357.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,664 INFO L168 Benchmark]: TraceAbstraction took 31363.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 850.5 MB in the end (delta: 249.9 MB). Peak memory consumption was 311.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,665 INFO L168 Benchmark]: Witness Printer took 72.49 ms. Allocated memory is still 1.2 GB. Free memory was 850.5 MB in the beginning and 843.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:59:13,668 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.72 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31363.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 850.5 MB in the end (delta: 249.9 MB). Peak memory consumption was 311.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.49 ms. Allocated memory is still 1.2 GB. Free memory was 850.5 MB in the beginning and 843.1 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant [2020-07-28 17:59:13,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~pa~0.offset,QUANTIFIED] [2020-07-28 17:59:13,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == (ad1 + pa * 7) % -8 && (ad1 + pa * -1) / -8 == unknown-#memory_int-unknown[ad1][ad1 + (ad1 + -pa) / -8 * 8]) && i <= unknown-#memory_int-unknown[pa][pa]) && (\exists ULTIMATE.start_main_~pa~0.offset : int :: ((unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset] <= i && 0 == (ad1 + ULTIMATE.start_main_~pa~0.offset * 7) % -8) && i <= unknown-#memory_int-unknown[ad1][ULTIMATE.start_main_~pa~0.offset]) && (ad1 + ULTIMATE.start_main_~pa~0.offset * -1) / -8 == unknown-#memory_int-unknown[ad1][ad1 + (ad1 + -ULTIMATE.start_main_~pa~0.offset) / -8 * 8])) && pa == ad1) && 1 <= \result - InvariantResult [Line: 26]: Loop Invariant [2020-07-28 17:59:13,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-28 17:59:13,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((0 == (ad1 + pa * 7) % -8 && i <= unknown-#memory_int-unknown[pa][pa]) && unknown-#memory_int-unknown[ad1][ad1 + (ad1 + pa * -1) / -8 * 8] == (ad1 + pa * -1) / -8) && pa == ad1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 31.0s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 SDtfs, 22 SDslu, 49 SDs, 0 SdLazy, 118 SolverSat, 6 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=4, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 137 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 240 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 95 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 87 ConstructedInterpolants, 7 QuantifiedInterpolants, 9551 SizeOfPredicates, 31 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 9/40 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...