/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:00:50,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:00:50,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:00:50,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:00:50,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:00:50,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:00:50,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:00:50,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:00:50,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:00:50,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:00:50,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:00:50,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:00:50,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:00:50,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:00:50,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:00:50,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:00:50,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:00:50,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:00:50,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:00:50,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:00:50,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:00:50,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:00:50,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:00:50,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:00:50,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:00:50,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:00:50,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:00:50,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:00:50,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:00:50,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:00:50,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:00:50,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:00:50,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:00:50,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:00:50,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:00:50,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:00:50,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:00:50,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:00:50,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:00:50,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:00:50,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:00:50,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:00:50,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:00:50,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:00:50,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:00:50,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:00:50,228 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:00:50,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:00:50,228 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:00:50,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:00:50,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:00:50,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:00:50,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:00:50,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:00:50,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:00:50,229 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:00:50,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:00:50,230 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:00:50,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:00:50,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:00:50,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:00:50,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:00:50,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:00:50,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:00:50,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:00:50,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:00:50,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:00:50,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:00:50,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:00:50,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:00:50,599 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:00:50,600 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:00:50,601 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-07-10 15:00:50,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1651f902a/b2925e23fe2a4d508d454ce38bc769b5/FLAGf39528ed5 [2020-07-10 15:00:51,157 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:00:51,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2020-07-10 15:00:51,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1651f902a/b2925e23fe2a4d508d454ce38bc769b5/FLAGf39528ed5 [2020-07-10 15:00:51,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1651f902a/b2925e23fe2a4d508d454ce38bc769b5 [2020-07-10 15:00:51,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:00:51,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:00:51,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:00:51,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:00:51,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:00:51,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:51,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b02f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51, skipping insertion in model container [2020-07-10 15:00:51,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:51,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:00:51,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:00:51,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:00:51,833 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:00:51,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:00:51,876 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:00:51,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51 WrapperNode [2020-07-10 15:00:51,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:00:51,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:00:51,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:00:51,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:00:51,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:51,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:51,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:51,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:52,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:52,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:52,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (1/1) ... [2020-07-10 15:00:52,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:00:52,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:00:52,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:00:52,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:00:52,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (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-10 15:00:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:00:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:00:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2020-07-10 15:00:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-07-10 15:00:52,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:00:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:00:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 15:00:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:00:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:00:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:00:52,375 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:00:52,375 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:00:52,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:00:52 BoogieIcfgContainer [2020-07-10 15:00:52,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:00:52,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:00:52,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:00:52,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:00:52,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:00:51" (1/3) ... [2020-07-10 15:00:52,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c03ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:00:52, skipping insertion in model container [2020-07-10 15:00:52,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:00:51" (2/3) ... [2020-07-10 15:00:52,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c03ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:00:52, skipping insertion in model container [2020-07-10 15:00:52,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:00:52" (3/3) ... [2020-07-10 15:00:52,390 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2020-07-10 15:00:52,404 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:00:52,414 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:00:52,435 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:00:52,468 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:00:52,468 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:00:52,468 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:00:52,468 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:00:52,469 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:00:52,469 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:00:52,469 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:00:52,469 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:00:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-10 15:00:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:00:52,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:00:52,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:00:52,521 INFO L427 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:00:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:00:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1703201428, now seen corresponding path program 1 times [2020-07-10 15:00:52,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:00:52,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886811878] [2020-07-10 15:00:52,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:00:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:52,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-10 15:00:52,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-10 15:00:52,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #31#return; {27#true} is VALID [2020-07-10 15:00:52,892 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:00:52,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-10 15:00:52,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-10 15:00:52,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #31#return; {27#true} is VALID [2020-07-10 15:00:52,894 INFO L263 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {27#true} is VALID [2020-07-10 15:00:52,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {32#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:00:52,900 INFO L263 TraceCheckUtils]: 6: Hoare triple {32#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {33#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:00:52,902 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {34#(= 10 |foo_#t~mem2|)} is VALID [2020-07-10 15:00:52,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(= 10 |foo_#t~mem2|)} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {28#false} is VALID [2020-07-10 15:00:52,905 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume !(20 == #t~mem3);havoc #t~mem3; {28#false} is VALID [2020-07-10 15:00:52,905 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-10 15:00:52,907 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-10 15:00:52,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886811878] [2020-07-10 15:00:52,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:00:52,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:00:52,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809446392] [2020-07-10 15:00:52,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:00:52,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:00:52,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:00:52,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:00:52,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:00:52,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:00:52,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:00:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:00:52,974 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2020-07-10 15:00:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:53,480 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-10 15:00:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:00:53,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-10 15:00:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:00:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:00:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-10 15:00:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:00:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-10 15:00:53,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-10 15:00:53,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:00:53,609 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:00:53,609 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:00:53,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:00:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:00:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-10 15:00:53,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:00:53,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-10 15:00:53,681 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-10 15:00:53,681 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-10 15:00:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:53,685 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:00:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:00:53,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:53,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:53,686 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-10 15:00:53,687 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-10 15:00:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:53,691 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:00:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 15:00:53,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:53,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:53,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:00:53,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:00:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:00:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-10 15:00:53,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2020-07-10 15:00:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:00:53,697 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-10 15:00:53,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:00:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 15:00:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:00:53,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:00:53,699 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:00:53,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:00:53,699 INFO L427 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:00:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:00:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1207469216, now seen corresponding path program 1 times [2020-07-10 15:00:53,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:00:53,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785306654] [2020-07-10 15:00:53,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:00:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:53,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-10 15:00:53,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-10 15:00:53,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {155#true} {155#true} #31#return; {155#true} is VALID [2020-07-10 15:00:53,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:00:53,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-10 15:00:53,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-10 15:00:53,978 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} #31#return; {155#true} is VALID [2020-07-10 15:00:53,978 INFO L263 TraceCheckUtils]: 4: Hoare triple {155#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {155#true} is VALID [2020-07-10 15:00:53,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {155#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {160#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:00:53,984 INFO L263 TraceCheckUtils]: 6: Hoare triple {160#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {161#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:00:53,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:53,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:53,990 INFO L263 TraceCheckUtils]: 9: Hoare triple {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {163#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:00:53,992 INFO L280 TraceCheckUtils]: 10: Hoare triple {163#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {164#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} is VALID [2020-07-10 15:00:53,995 INFO L263 TraceCheckUtils]: 11: Hoare triple {164#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} call foo(~p.base, ~p.offset); {165#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} is VALID [2020-07-10 15:00:53,996 INFO L280 TraceCheckUtils]: 12: Hoare triple {165#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {166#(<= |foo_#t~mem2| 11)} is VALID [2020-07-10 15:00:53,997 INFO L280 TraceCheckUtils]: 13: Hoare triple {166#(<= |foo_#t~mem2| 11)} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {156#false} is VALID [2020-07-10 15:00:53,998 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#false} assume !(20 == #t~mem3);havoc #t~mem3; {156#false} is VALID [2020-07-10 15:00:53,998 INFO L280 TraceCheckUtils]: 15: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-10 15:00:54,003 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-10 15:00:54,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785306654] [2020-07-10 15:00:54,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199947415] [2020-07-10 15:00:54,006 INFO L94 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-10 15:00:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:54,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-10 15:00:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:54,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:00:54,183 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 11 treesize of output 7 [2020-07-10 15:00:54,184 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:00:54,191 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:00:54,192 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:00:54,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-10 15:00:54,243 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-10 15:00:54,246 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:00:54,252 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:00:54,253 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:00:54,253 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-07-10 15:00:56,296 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:00:56,297 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|]. (let ((.cse0 (select |v_#memory_int_16| plus_~p.base))) (let ((.cse1 (select .cse0 plus_~p.offset))) (and (= |#memory_int| (store |v_#memory_int_16| plus_~p.base (store .cse0 plus_~p.offset (+ .cse1 1)))) (= 10 .cse1)))) [2020-07-10 15:00:56,297 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) [2020-07-10 15:00:56,489 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 22 treesize of output 10 [2020-07-10 15:00:56,492 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:00:56,503 INFO L624 ElimStorePlain]: treesize reduction 6, result has 14.3 percent of original size [2020-07-10 15:00:56,504 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-10 15:00:56,504 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:1 [2020-07-10 15:00:56,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {155#true} call ULTIMATE.init(); {155#true} is VALID [2020-07-10 15:00:56,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {155#true} is VALID [2020-07-10 15:00:56,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#true} assume true; {155#true} is VALID [2020-07-10 15:00:56,511 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {155#true} {155#true} #31#return; {155#true} is VALID [2020-07-10 15:00:56,511 INFO L263 TraceCheckUtils]: 4: Hoare triple {155#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {155#true} is VALID [2020-07-10 15:00:56,514 INFO L280 TraceCheckUtils]: 5: Hoare triple {155#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {160#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:00:56,517 INFO L263 TraceCheckUtils]: 6: Hoare triple {160#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {161#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:00:56,519 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:56,520 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:56,522 INFO L263 TraceCheckUtils]: 9: Hoare triple {162#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {163#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:00:56,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {163#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {201#(= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} is VALID [2020-07-10 15:00:56,526 INFO L263 TraceCheckUtils]: 11: Hoare triple {201#(= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} call foo(~p.base, ~p.offset); {205#(= 11 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:00:56,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(= 11 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {209#(and (= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)))} is VALID [2020-07-10 15:00:56,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {209#(and (= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)))} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {156#false} is VALID [2020-07-10 15:00:56,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {156#false} assume !(20 == #t~mem3);havoc #t~mem3; {156#false} is VALID [2020-07-10 15:00:56,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {156#false} assume !false; {156#false} is VALID [2020-07-10 15:00:56,532 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-10 15:00:56,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:00:56,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2020-07-10 15:00:56,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639696523] [2020-07-10 15:00:56,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-07-10 15:00:56,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:00:56,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:00:56,586 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-10 15:00:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:00:56,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:00:56,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:00:56,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:00:56,590 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2020-07-10 15:00:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:57,286 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:00:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:00:57,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-07-10 15:00:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:00:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:00:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2020-07-10 15:00:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:00:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2020-07-10 15:00:57,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 26 transitions. [2020-07-10 15:00:57,343 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-10 15:00:57,344 INFO L225 Difference]: With dead ends: 26 [2020-07-10 15:00:57,345 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 15:00:57,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:00:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 15:00:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-10 15:00:57,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:00:57,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-10 15:00:57,378 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-10 15:00:57,378 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-10 15:00:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:57,380 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 15:00:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 15:00:57,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:57,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:57,381 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-10 15:00:57,381 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-10 15:00:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:00:57,384 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 15:00:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 15:00:57,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:00:57,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:00:57,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:00:57,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:00:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:00:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-10 15:00:57,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-07-10 15:00:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:00:57,387 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-10 15:00:57,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:00:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 15:00:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:00:57,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:00:57,388 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:00:57,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:00:57,604 INFO L427 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:00:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:00:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1866674708, now seen corresponding path program 2 times [2020-07-10 15:00:57,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:00:57,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952542642] [2020-07-10 15:00:57,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:00:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:57,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-10 15:00:57,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#true} assume true; {355#true} is VALID [2020-07-10 15:00:57,906 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {355#true} {355#true} #31#return; {355#true} is VALID [2020-07-10 15:00:57,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {371#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:00:57,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-10 15:00:57,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2020-07-10 15:00:57,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #31#return; {355#true} is VALID [2020-07-10 15:00:57,908 INFO L263 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {355#true} is VALID [2020-07-10 15:00:57,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {360#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:00:57,913 INFO L263 TraceCheckUtils]: 6: Hoare triple {360#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {361#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:00:57,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {361#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:57,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:00:57,916 INFO L263 TraceCheckUtils]: 9: Hoare triple {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {363#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:00:57,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {364#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} is VALID [2020-07-10 15:00:57,918 INFO L263 TraceCheckUtils]: 11: Hoare triple {364#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} call foo(~p.base, ~p.offset); {365#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} is VALID [2020-07-10 15:00:57,919 INFO L280 TraceCheckUtils]: 12: Hoare triple {365#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {366#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} is VALID [2020-07-10 15:00:57,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {366#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} assume #t~mem2 < 20;havoc #t~mem2; {366#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} is VALID [2020-07-10 15:00:57,921 INFO L263 TraceCheckUtils]: 14: Hoare triple {366#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} call plus(~p.base, ~p.offset); {367#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 11)} is VALID [2020-07-10 15:00:57,923 INFO L280 TraceCheckUtils]: 15: Hoare triple {367#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {368#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 12)} is VALID [2020-07-10 15:00:57,924 INFO L263 TraceCheckUtils]: 16: Hoare triple {368#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 12)} call foo(~p.base, ~p.offset); {369#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 12)} is VALID [2020-07-10 15:00:57,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {369#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 12)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {370#(<= |foo_#t~mem2| 12)} is VALID [2020-07-10 15:00:57,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {370#(<= |foo_#t~mem2| 12)} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {356#false} is VALID [2020-07-10 15:00:57,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {356#false} assume !(20 == #t~mem3);havoc #t~mem3; {356#false} is VALID [2020-07-10 15:00:57,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {356#false} assume !false; {356#false} is VALID [2020-07-10 15:00:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:00:57,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952542642] [2020-07-10 15:00:57,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531689137] [2020-07-10 15:00:57,928 INFO L92 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-10 15:00:57,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:00:57,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:00:57,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 58 conjunts are in the unsatisfiable core [2020-07-10 15:00:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:00:58,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:00:58,026 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 11 treesize of output 7 [2020-07-10 15:00:58,027 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:00:58,030 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:00:58,031 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:00:58,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-10 15:00:58,064 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-10 15:00:58,066 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:00:58,069 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:00:58,069 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:00:58,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-07-10 15:01:00,098 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:00,098 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|]. (let ((.cse1 (select |v_#memory_int_18| plus_~p.base))) (let ((.cse0 (select .cse1 plus_~p.offset))) (and (= 10 .cse0) (= (store |v_#memory_int_18| plus_~p.base (store .cse1 plus_~p.offset (+ .cse0 1))) |#memory_int|)))) [2020-07-10 15:01:00,098 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) [2020-07-10 15:01:00,222 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-10 15:01:00,227 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:00,230 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:00,230 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:01:00,231 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-07-10 15:01:02,257 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:02,258 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| plus_~p.base))) (let ((.cse1 (select .cse0 plus_~p.offset))) (and (= (store |v_#memory_int_19| plus_~p.base (store .cse0 plus_~p.offset (+ .cse1 1))) |#memory_int|) (= .cse1 11)))) [2020-07-10 15:01:02,258 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 12 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) [2020-07-10 15:01:02,378 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 22 treesize of output 10 [2020-07-10 15:01:02,385 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:02,389 INFO L624 ElimStorePlain]: treesize reduction 6, result has 14.3 percent of original size [2020-07-10 15:01:02,390 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-10 15:01:02,391 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:1 [2020-07-10 15:01:02,393 INFO L263 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2020-07-10 15:01:02,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-10 15:01:02,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2020-07-10 15:01:02,394 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #31#return; {355#true} is VALID [2020-07-10 15:01:02,394 INFO L263 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {355#true} is VALID [2020-07-10 15:01:02,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {360#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:01:02,397 INFO L263 TraceCheckUtils]: 6: Hoare triple {360#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {361#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:01:02,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {361#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:02,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:02,399 INFO L263 TraceCheckUtils]: 9: Hoare triple {362#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {363#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:01:02,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {405#(= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} is VALID [2020-07-10 15:01:02,402 INFO L263 TraceCheckUtils]: 11: Hoare triple {405#(= 11 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} call foo(~p.base, ~p.offset); {409#(= 11 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:01:02,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(= 11 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {413#(= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:02,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {413#(= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {413#(= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:02,405 INFO L263 TraceCheckUtils]: 14: Hoare triple {413#(= 11 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {420#(= 11 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:01:02,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {420#(= 11 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {424#(= 12 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} is VALID [2020-07-10 15:01:02,408 INFO L263 TraceCheckUtils]: 16: Hoare triple {424#(= 12 (select (select |#memory_int| plus_~p.base) plus_~p.offset))} call foo(~p.base, ~p.offset); {428#(= 12 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:01:02,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {428#(= 12 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {432#(and (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (= 12 (select (select |#memory_int| foo_~p.base) foo_~p.offset)))} is VALID [2020-07-10 15:01:02,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {432#(and (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (= 12 (select (select |#memory_int| foo_~p.base) foo_~p.offset)))} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {356#false} is VALID [2020-07-10 15:01:02,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {356#false} assume !(20 == #t~mem3);havoc #t~mem3; {356#false} is VALID [2020-07-10 15:01:02,410 INFO L280 TraceCheckUtils]: 20: Hoare triple {356#false} assume !false; {356#false} is VALID [2020-07-10 15:01:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:02,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:01:02,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2020-07-10 15:01:02,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488094848] [2020-07-10 15:01:02,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2020-07-10 15:01:02,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:02,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:01:02,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:02,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:01:02,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:01:02,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:01:02,469 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2020-07-10 15:01:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,775 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 15:01:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:01:03,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2020-07-10 15:01:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:01:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2020-07-10 15:01:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:01:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2020-07-10 15:01:03,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 31 transitions. [2020-07-10 15:01:03,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:03,836 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:01:03,836 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:01:03,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 15:01:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:01:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:01:03,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:03,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:01:03,880 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:01:03,880 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:01:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,882 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:01:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:01:03,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:03,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:03,883 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:01:03,884 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:01:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:03,886 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:01:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:01:03,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:03,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:03,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:03,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:01:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 15:01:03,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-07-10 15:01:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:03,891 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 15:01:03,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:01:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:01:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:01:03,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:01:03,892 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:01:04,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:04,095 INFO L427 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:01:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:01:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1116654880, now seen corresponding path program 3 times [2020-07-10 15:01:04,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:01:04,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284422898] [2020-07-10 15:01:04,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:01:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:01:04,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:01:04,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {616#true} {616#true} #31#return; {616#true} is VALID [2020-07-10 15:01:04,532 INFO L263 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:01:04,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:01:04,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:01:04,533 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #31#return; {616#true} is VALID [2020-07-10 15:01:04,533 INFO L263 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {616#true} is VALID [2020-07-10 15:01:04,535 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {621#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:01:04,536 INFO L263 TraceCheckUtils]: 6: Hoare triple {621#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call foo(~p~0.base, ~p~0.offset); {622#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} is VALID [2020-07-10 15:01:04,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {622#(= 10 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {623#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:04,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {623#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} assume #t~mem2 < 20;havoc #t~mem2; {623#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} is VALID [2020-07-10 15:01:04,545 INFO L263 TraceCheckUtils]: 9: Hoare triple {623#(= 10 (select (select |#memory_int| foo_~p.base) foo_~p.offset))} call plus(~p.base, ~p.offset); {624#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} is VALID [2020-07-10 15:01:04,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {624#(= 10 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {625#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} is VALID [2020-07-10 15:01:04,548 INFO L263 TraceCheckUtils]: 11: Hoare triple {625#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 11)} call foo(~p.base, ~p.offset); {626#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} is VALID [2020-07-10 15:01:04,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {626#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {627#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} is VALID [2020-07-10 15:01:04,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {627#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} assume #t~mem2 < 20;havoc #t~mem2; {627#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} is VALID [2020-07-10 15:01:04,551 INFO L263 TraceCheckUtils]: 14: Hoare triple {627#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 11)} call plus(~p.base, ~p.offset); {628#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 11)} is VALID [2020-07-10 15:01:04,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {628#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 11)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {629#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 12)} is VALID [2020-07-10 15:01:04,553 INFO L263 TraceCheckUtils]: 16: Hoare triple {629#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 12)} call foo(~p.base, ~p.offset); {630#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 12)} is VALID [2020-07-10 15:01:04,554 INFO L280 TraceCheckUtils]: 17: Hoare triple {630#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 12)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {631#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 12)} is VALID [2020-07-10 15:01:04,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {631#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 12)} assume #t~mem2 < 20;havoc #t~mem2; {631#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 12)} is VALID [2020-07-10 15:01:04,555 INFO L263 TraceCheckUtils]: 19: Hoare triple {631#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 12)} call plus(~p.base, ~p.offset); {632#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 12)} is VALID [2020-07-10 15:01:04,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {632#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 12)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {633#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 13)} is VALID [2020-07-10 15:01:04,558 INFO L263 TraceCheckUtils]: 21: Hoare triple {633#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 13)} call foo(~p.base, ~p.offset); {634#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 13)} is VALID [2020-07-10 15:01:04,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {634#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 13)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {635#(<= |foo_#t~mem2| 13)} is VALID [2020-07-10 15:01:04,560 INFO L280 TraceCheckUtils]: 23: Hoare triple {635#(<= |foo_#t~mem2| 13)} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {617#false} is VALID [2020-07-10 15:01:04,561 INFO L280 TraceCheckUtils]: 24: Hoare triple {617#false} assume !(20 == #t~mem3);havoc #t~mem3; {617#false} is VALID [2020-07-10 15:01:04,561 INFO L280 TraceCheckUtils]: 25: Hoare triple {617#false} assume !false; {617#false} is VALID [2020-07-10 15:01:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:01:04,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284422898] [2020-07-10 15:01:04,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865217576] [2020-07-10 15:01:04,564 INFO L92 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-10 15:01:04,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:01:04,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:01:04,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-10 15:01:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:01:04,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:01:04,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-10 15:01:04,674 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:04,675 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:04,676 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:01:04,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:1 [2020-07-10 15:01:05,199 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:05,199 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|]. (= |#memory_int| (store |v_#memory_int_20| plus_~p.base (let ((.cse0 (select |v_#memory_int_20| plus_~p.base))) (store .cse0 plus_~p.offset (+ (select .cse0 plus_~p.offset) 1))))) [2020-07-10 15:01:05,199 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. true [2020-07-10 15:01:05,313 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-10 15:01:05,323 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:05,325 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:05,326 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:01:05,326 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2020-07-10 15:01:07,361 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:07,361 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|]. (let ((.cse1 (select |v_#memory_int_21| plus_~p.base))) (let ((.cse0 (select .cse1 plus_~p.offset))) (and (<= .cse0 19) (= |#memory_int| (store |v_#memory_int_21| plus_~p.base (store .cse1 plus_~p.offset (+ .cse0 1))))))) [2020-07-10 15:01:07,361 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 20) [2020-07-10 15:01:07,489 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 22 treesize of output 10 [2020-07-10 15:01:07,494 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:01:07,497 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:01:07,498 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-10 15:01:07,498 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-10 15:01:07,501 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:01:07,502 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, foo_~p.base, foo_~p.offset]. (let ((.cse0 (select (select |#memory_int| foo_~p.base) foo_~p.offset))) (and (<= 20 .cse0) (= |foo_#t~mem3| .cse0) (<= .cse0 20))) [2020-07-10 15:01:07,502 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |foo_#t~mem3| 20) (<= 20 |foo_#t~mem3|)) [2020-07-10 15:01:07,545 INFO L263 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {616#true} is VALID [2020-07-10 15:01:07,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {616#true} is VALID [2020-07-10 15:01:07,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2020-07-10 15:01:07,546 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #31#return; {616#true} is VALID [2020-07-10 15:01:07,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret4 := main(#in~argc, #in~argv.base, #in~argv.offset); {616#true} is VALID [2020-07-10 15:01:07,546 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 4);~p~0.base, ~p~0.offset := ~#x~0.base, ~#x~0.offset;call write~int(10, ~p~0.base, ~p~0.offset, 4); {616#true} is VALID [2020-07-10 15:01:07,547 INFO L263 TraceCheckUtils]: 6: Hoare triple {616#true} call foo(~p~0.base, ~p~0.offset); {616#true} is VALID [2020-07-10 15:01:07,547 INFO L280 TraceCheckUtils]: 7: Hoare triple {616#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {616#true} is VALID [2020-07-10 15:01:07,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {616#true} assume #t~mem2 < 20;havoc #t~mem2; {616#true} is VALID [2020-07-10 15:01:07,547 INFO L263 TraceCheckUtils]: 9: Hoare triple {616#true} call plus(~p.base, ~p.offset); {616#true} is VALID [2020-07-10 15:01:07,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {616#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {616#true} is VALID [2020-07-10 15:01:07,548 INFO L263 TraceCheckUtils]: 11: Hoare triple {616#true} call foo(~p.base, ~p.offset); {616#true} is VALID [2020-07-10 15:01:07,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {616#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {616#true} is VALID [2020-07-10 15:01:07,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#true} assume #t~mem2 < 20;havoc #t~mem2; {616#true} is VALID [2020-07-10 15:01:07,549 INFO L263 TraceCheckUtils]: 14: Hoare triple {616#true} call plus(~p.base, ~p.offset); {616#true} is VALID [2020-07-10 15:01:07,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {616#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {616#true} is VALID [2020-07-10 15:01:07,549 INFO L263 TraceCheckUtils]: 16: Hoare triple {616#true} call foo(~p.base, ~p.offset); {616#true} is VALID [2020-07-10 15:01:07,553 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#true} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {691#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) |foo_#t~mem2|)} is VALID [2020-07-10 15:01:07,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {691#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) |foo_#t~mem2|)} assume #t~mem2 < 20;havoc #t~mem2; {695#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 19)} is VALID [2020-07-10 15:01:07,556 INFO L263 TraceCheckUtils]: 19: Hoare triple {695#(<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 19)} call plus(~p.base, ~p.offset); {699#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 19)} is VALID [2020-07-10 15:01:07,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {699#(<= (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|) 19)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem0 := read~int(~p.base, ~p.offset, 4);#t~post1 := #t~mem0;call write~int(1 + #t~post1, ~p.base, ~p.offset, 4);havoc #t~post1;havoc #t~mem0; {703#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 20)} is VALID [2020-07-10 15:01:07,558 INFO L263 TraceCheckUtils]: 21: Hoare triple {703#(<= (select (select |#memory_int| plus_~p.base) plus_~p.offset) 20)} call foo(~p.base, ~p.offset); {707#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 20)} is VALID [2020-07-10 15:01:07,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {707#(<= (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|) 20)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem2 := read~int(~p.base, ~p.offset, 4); {711#(and (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20))} is VALID [2020-07-10 15:01:07,560 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#(and (<= |foo_#t~mem2| (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (<= (select (select |#memory_int| foo_~p.base) foo_~p.offset) 20))} assume !(#t~mem2 < 20);havoc #t~mem2;call #t~mem3 := read~int(~p.base, ~p.offset, 4); {715#(and (<= 20 |foo_#t~mem3|) (<= |foo_#t~mem3| 20))} is VALID [2020-07-10 15:01:07,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {715#(and (<= 20 |foo_#t~mem3|) (<= |foo_#t~mem3| 20))} assume !(20 == #t~mem3);havoc #t~mem3; {617#false} is VALID [2020-07-10 15:01:07,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {617#false} assume !false; {617#false} is VALID [2020-07-10 15:01:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:01:07,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:01:07,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2020-07-10 15:01:07,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246212255] [2020-07-10 15:01:07,563 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2020-07-10 15:01:07,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:01:07,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-10 15:01:07,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:07,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-10 15:01:07,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:01:07,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-10 15:01:07,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2020-07-10 15:01:07,630 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2020-07-10 15:01:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:09,490 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-10 15:01:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-10 15:01:09,490 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2020-07-10 15:01:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:01:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:01:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-10 15:01:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:01:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-10 15:01:09,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2020-07-10 15:01:09,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:01:09,577 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:01:09,578 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:01:09,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=348, Invalid=2004, Unknown=0, NotChecked=0, Total=2352 [2020-07-10 15:01:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:01:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:01:09,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:01:09,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:01:09,582 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:01:09,582 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:01:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:09,582 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:01:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:01:09,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:09,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:09,583 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:01:09,583 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:01:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:01:09,583 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:01:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:01:09,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:09,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:01:09,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:01:09,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:01:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:01:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:01:09,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-10 15:01:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:01:09,585 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:01:09,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-10 15:01:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:01:09,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:01:09,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:01:09,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:01:10,157 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-07-10 15:01:10,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:01:10,354 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:01:10,354 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:01:10,354 INFO L268 CegarLoopResult]: For program point fooEXIT(lines 9 18) no Hoare annotation was computed. [2020-07-10 15:01:10,355 INFO L264 CegarLoopResult]: At program point fooENTRY(lines 9 18) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse0 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (= 12 .cse0) (not (= 12 .cse1))) (or (<= .cse0 13) (not (<= .cse1 13))) (or (not (= 10 .cse1)) (= 10 .cse0)) (or (= 11 .cse0) (not (= 11 .cse1))) (or (not (<= .cse1 20)) (<= .cse0 20)))) [2020-07-10 15:01:10,355 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-10 15:01:10,355 INFO L268 CegarLoopResult]: For program point fooErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-07-10 15:01:10,355 INFO L268 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-07-10 15:01:10,355 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse2 (select (select |#memory_int| foo_~p.base) foo_~p.offset)) (.cse0 (select (select |#memory_int| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (<= .cse0 13) (not (<= .cse1 13))) (or (and (<= .cse0 12) (<= .cse2 12)) (not (= 12 .cse1))) (or (not (= 11 .cse1)) (and (= 11 .cse0) (= 11 .cse2))) (or (not (= 10 .cse1)) (and (= 10 .cse2) (= 10 .cse0))) (or (not (<= .cse1 20)) (and (<= .cse2 19) (<= .cse0 20))))) [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point L10(lines 10 17) no Hoare annotation was computed. [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point L10-1(lines 9 18) no Hoare annotation was computed. [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:01:10,356 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:01:10,356 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:01:10,356 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 26) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 26) no Hoare annotation was computed. [2020-07-10 15:01:10,356 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-10 15:01:10,356 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 26) no Hoare annotation was computed. [2020-07-10 15:01:10,357 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-10 15:01:10,357 INFO L268 CegarLoopResult]: For program point plusFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:01:10,357 INFO L264 CegarLoopResult]: At program point plusENTRY(lines 4 7) the Hoare annotation is: (let ((.cse1 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse0 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (<= .cse0 19) (not (<= .cse1 19))) (or (not (= 11 .cse1)) (= 11 .cse0)) (or (<= .cse0 12) (not (<= .cse1 12))) (or (not (= 10 .cse1)) (= 10 .cse0)))) [2020-07-10 15:01:10,357 INFO L268 CegarLoopResult]: For program point plusEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:01:10,357 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse2 (select (select |#memory_int| plus_~p.base) plus_~p.offset)) (.cse0 (select (select |old(#memory_int)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (not (<= .cse0 12)) (and (<= .cse1 19) (<= .cse2 13))) (or (not (<= .cse0 19)) (<= .cse2 20)) (or (not (= 11 .cse0)) (and (= 12 .cse2) (<= .cse1 12))) (or (and (= 11 .cse1) (= 11 .cse2)) (not (= 10 .cse0))))) [2020-07-10 15:01:10,362 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:01:10,362 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 15:01:10,366 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:01:10,366 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 15:01:10,366 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-10 15:01:10,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:01:10,367 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 15:01:10,368 WARN L170 areAnnotationChecker]: plusFINAL has no Hoare annotation [2020-07-10 15:01:10,369 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:01:10,369 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2020-07-10 15:01:10,370 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:01:10,370 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:01:10,370 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:01:10,371 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-10 15:01:10,371 WARN L170 areAnnotationChecker]: plusFINAL has no Hoare annotation [2020-07-10 15:01:10,371 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2020-07-10 15:01:10,371 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 15:01:10,371 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 15:01:10,372 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:01:10,372 WARN L170 areAnnotationChecker]: plusEXIT has no Hoare annotation [2020-07-10 15:01:10,372 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2020-07-10 15:01:10,372 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2020-07-10 15:01:10,372 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:01:10,372 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:01:10,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:01:10 BoogieIcfgContainer [2020-07-10 15:01:10,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:01:10,377 INFO L168 Benchmark]: Toolchain (without parser) took 18833.94 ms. Allocated memory was 136.8 MB in the beginning and 305.7 MB in the end (delta: 168.8 MB). Free memory was 100.9 MB in the beginning and 163.8 MB in the end (delta: -62.8 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,378 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.00 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,379 INFO L168 Benchmark]: Boogie Preprocessor took 143.32 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 90.7 MB in the beginning and 178.8 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,380 INFO L168 Benchmark]: RCFGBuilder took 359.28 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 159.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,381 INFO L168 Benchmark]: TraceAbstraction took 17993.14 ms. Allocated memory was 201.3 MB in the beginning and 305.7 MB in the end (delta: 104.3 MB). Free memory was 159.9 MB in the beginning and 163.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:01:10,384 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 1.34 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.00 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.32 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 90.7 MB in the beginning and 178.8 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.28 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 159.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17993.14 ms. Allocated memory was 201.3 MB in the beginning and 305.7 MB in the end (delta: 104.3 MB). Free memory was 159.9 MB in the beginning and 163.8 MB in the end (delta: -3.8 MB). Peak memory consumption was 100.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.3s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 SDtfs, 49 SDslu, 220 SDs, 0 SdLazy, 593 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 25 NumberOfFragments, 370 HoareAnnotationTreeSize, 25 FomulaSimplifications, 700 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 291 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 137 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 11920 SizeOfPredicates, 42 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 20/64 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...