java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:43:25,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:43:25,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:43:25,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:43:25,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:43:25,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:43:25,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:43:25,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:43:25,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:43:25,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:43:25,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:43:25,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:43:25,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:43:25,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:43:25,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:43:25,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:43:25,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:43:25,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:43:25,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:43:25,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:43:25,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:43:25,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:43:25,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:43:25,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:43:25,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:43:25,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:43:25,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:43:25,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:43:25,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:43:25,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:43:25,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:43:25,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:43:25,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:43:25,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:43:25,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:43:25,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:43:25,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:43:25,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:43:25,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:43:25,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:43:25,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:43:25,608 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 [2019-10-07 13:43:25,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:43:25,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:43:25,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:43:25,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:43:25,625 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:43:25,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:43:25,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:43:25,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:43:25,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:43:25,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:43:25,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:43:25,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:43:25,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:43:25,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:43:25,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:43:25,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:43:25,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:43:25,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:43:25,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:43:25,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:43:25,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:43:25,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:43:25,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:43:25,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:43:25,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:43:25,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:43:25,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:43:25,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:43:25,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:43:25,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:43:25,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:43:25,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:43:25,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:43:25,915 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:43:25,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-07 13:43:25,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafad91b/d95b11775afb460b9da1b63cc2a1a9b6/FLAGb4aded3ee [2019-10-07 13:43:26,387 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:43:26,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-07 13:43:26,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafad91b/d95b11775afb460b9da1b63cc2a1a9b6/FLAGb4aded3ee [2019-10-07 13:43:26,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafad91b/d95b11775afb460b9da1b63cc2a1a9b6 [2019-10-07 13:43:26,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:43:26,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:43:26,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:26,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:43:26,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:43:26,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:26" (1/1) ... [2019-10-07 13:43:26,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47dba115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:26, skipping insertion in model container [2019-10-07 13:43:26,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:26" (1/1) ... [2019-10-07 13:43:26,834 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:43:26,852 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:43:27,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:27,029 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:43:27,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:27,064 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:43:27,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27 WrapperNode [2019-10-07 13:43:27,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:27,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:43:27,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:43:27,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:43:27,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (1/1) ... [2019-10-07 13:43:27,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:43:27,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:43:27,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:43:27,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:43:27,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (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 [2019-10-07 13:43:27,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:43:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:43:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:43:27,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:43:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:43:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:43:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:43:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:43:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:43:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:43:27,579 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:43:27,579 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:43:27,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:27 BoogieIcfgContainer [2019-10-07 13:43:27,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:43:27,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:43:27,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:43:27,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:43:27,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:43:26" (1/3) ... [2019-10-07 13:43:27,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573748ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:27, skipping insertion in model container [2019-10-07 13:43:27,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:27" (2/3) ... [2019-10-07 13:43:27,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573748ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:27, skipping insertion in model container [2019-10-07 13:43:27,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:27" (3/3) ... [2019-10-07 13:43:27,588 INFO L109 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2019-10-07 13:43:27,598 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:43:27,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:43:27,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:43:27,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:43:27,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:43:27,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:43:27,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:43:27,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:43:27,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:43:27,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:43:27,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:43:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-07 13:43:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:43:27,665 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:27,666 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:27,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1720712542, now seen corresponding path program 1 times [2019-10-07 13:43:27,680 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:27,680 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:27,681 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:27,681 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:27,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:27,871 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:43:27,872 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:43:27,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:43:27,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:43:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:43:27,895 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-10-07 13:43:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:28,002 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-07 13:43:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:43:28,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:43:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:28,016 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:43:28,016 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 13:43:28,022 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:43:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 13:43:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 13:43:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 13:43:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-07 13:43:28,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-07 13:43:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:28,073 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-07 13:43:28,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:43:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-07 13:43:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:43:28,076 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:28,076 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:28,077 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash -825415550, now seen corresponding path program 1 times [2019-10-07 13:43:28,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:28,079 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:28,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:28,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:28,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:28,331 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:28,331 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:28,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 13:43:28,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:28,476 INFO L375 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 [2019-10-07 13:43:28,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:28,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-07 13:43:28,542 INFO L375 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 15 treesize of output 7 [2019-10-07 13:43:28,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:28,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-07 13:43:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:28,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:28,629 INFO L375 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 14 treesize of output 12 [2019-10-07 13:43:28,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-10-07 13:43:28,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:28,645 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:43:28,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:43:28,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 13:43:28,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:7 [2019-10-07 13:43:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:28,673 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:28,707 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 13:43:28,708 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:28,715 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:28,723 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:28,724 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:28,895 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:29,335 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-07 13:43:29,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:29,366 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:29,366 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:29,367 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (not (< main_~i~0 main_~n~0)) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:29,368 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 110#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:29,372 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:43:29,372 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:29,373 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 86#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (not (< main_~i~0 main_~n~0)) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (< main_~i~1 main_~n~0) (= main_~i~1 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_#t~mem5| (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset))) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:29,373 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:29,374 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:29,374 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 115#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:29,375 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:29,375 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (or (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0)) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:43:29,376 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 96#(and (exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (or (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0)) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:43:29,376 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 91#(exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (or (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0)) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:29,376 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 106#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (or (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= v_main_~x~0.offset_BEFORE_CALL_1 0) (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) v_main_~x~0.offset_BEFORE_CALL_1) 0)) (<= 0 v_main_~x~0.offset_BEFORE_CALL_1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:43:30,077 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:30,078 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 24 [2019-10-07 13:43:30,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 13:43:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 13:43:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-10-07 13:43:30,086 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 24 states. [2019-10-07 13:43:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:30,920 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-07 13:43:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 13:43:30,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 13 [2019-10-07 13:43:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:30,923 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:43:30,923 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 13:43:30,925 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:43:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 13:43:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-10-07 13:43:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:43:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-07 13:43:30,936 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-10-07 13:43:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:30,937 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-07 13:43:30,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 13:43:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-07 13:43:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:43:30,938 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:30,938 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:31,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:31,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:31,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1785378702, now seen corresponding path program 1 times [2019-10-07 13:43:31,144 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:31,145 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:31,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:31,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:31,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:31,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-10-07 13:43:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:31,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:43:31,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:31,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:31,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:31,360 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:43:31,360 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:31,361 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:31,361 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:31,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:31,407 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:32,120 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:43:32,177 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:32,198 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:32,198 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:32,199 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:43:32,199 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:32,200 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,201 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:43:32,201 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (<= 0 (+ main_~n~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,201 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:32,202 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:32,202 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,202 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,203 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:32,204 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:32,204 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:32,204 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:32,204 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:33,049 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:33,050 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 13] total 23 [2019-10-07 13:43:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 13:43:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 13:43:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:43:33,052 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 23 states. [2019-10-07 13:43:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:34,194 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-07 13:43:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:43:34,195 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-07 13:43:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:34,198 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:43:34,198 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 13:43:34,200 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-10-07 13:43:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 13:43:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-07 13:43:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 13:43:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-07 13:43:34,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-10-07 13:43:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:34,213 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-07 13:43:34,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 13:43:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-07 13:43:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:43:34,214 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:34,214 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:34,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:34,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1645445454, now seen corresponding path program 2 times [2019-10-07 13:43:34,418 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:34,418 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:34,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:34,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:34,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:34,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:34,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:34,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 13:43:34,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:34,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 13:43:34,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:35,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:37,815 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:37,817 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:43:37,817 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:37,818 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:37,818 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:37,818 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:37,860 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:38,295 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:43:38,326 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:38,329 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:38,329 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:38,330 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:43:38,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:38,330 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,330 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:43:38,331 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (<= 0 (+ main_~n~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,331 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:38,331 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:38,331 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,332 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,332 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:38,332 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:38,333 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:38,333 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:38,333 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:39,296 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:39,297 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 13] total 30 [2019-10-07 13:43:39,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 13:43:39,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 13:43:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=778, Unknown=2, NotChecked=0, Total=870 [2019-10-07 13:43:39,299 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 30 states. [2019-10-07 13:43:40,547 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-10-07 13:43:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:40,945 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-07 13:43:40,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:43:40,946 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 21 [2019-10-07 13:43:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:40,948 INFO L225 Difference]: With dead ends: 32 [2019-10-07 13:43:40,948 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:43:40,950 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=266, Invalid=1802, Unknown=2, NotChecked=0, Total=2070 [2019-10-07 13:43:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:43:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-07 13:43:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:43:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-07 13:43:40,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-10-07 13:43:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:40,958 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-07 13:43:40,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 13:43:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-07 13:43:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:43:40,960 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:40,960 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:41,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:41,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1236732766, now seen corresponding path program 3 times [2019-10-07 13:43:41,170 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:41,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:41,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:41,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:41,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:43:41,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:41,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 13:43:41,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:41,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:41,394 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:41,395 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:43:41,395 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:41,396 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:41,396 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:41,397 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:41,421 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:41,713 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:43:41,744 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:41,748 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:41,748 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:41,748 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:43:41,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:41,749 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,749 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:43:41,749 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (<= 0 (+ main_~n~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,750 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:41,750 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:41,750 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,750 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,750 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:41,751 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:41,751 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:41,751 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:41,752 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:42,561 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:42,562 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 13] total 26 [2019-10-07 13:43:42,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-07 13:43:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-07 13:43:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:43:42,564 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 26 states. [2019-10-07 13:43:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:43,885 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-10-07 13:43:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 13:43:43,886 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-10-07 13:43:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:43,887 INFO L225 Difference]: With dead ends: 46 [2019-10-07 13:43:43,888 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:43:43,889 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 13:43:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:43:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-07 13:43:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 13:43:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-07 13:43:43,897 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2019-10-07 13:43:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:43,897 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-07 13:43:43,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-07 13:43:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-07 13:43:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 13:43:43,898 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:43,899 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:44,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:44,102 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2015456898, now seen corresponding path program 4 times [2019-10-07 13:43:44,103 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:44,103 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:44,103 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:44,104 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:44,240 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:44,240 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:44,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:44,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 13:43:44,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:51,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:43:53,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:53,440 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:43:53,440 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:53,441 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:53,453 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:53,453 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:53,492 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:53,774 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:43:53,795 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:53,799 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:53,799 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:53,799 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:43:53,799 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:53,799 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:53,799 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (= |main_#t~malloc2.offset| 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:43:53,800 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:53,801 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:53,801 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:53,801 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:53,801 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:53,801 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:54,756 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:54,756 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13] total 31 [2019-10-07 13:43:54,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-07 13:43:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-07 13:43:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=835, Unknown=3, NotChecked=0, Total=930 [2019-10-07 13:43:54,759 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 31 states. [2019-10-07 13:43:56,689 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-10-07 13:43:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:56,695 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-07 13:43:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 13:43:56,695 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2019-10-07 13:43:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:56,697 INFO L225 Difference]: With dead ends: 38 [2019-10-07 13:43:56,697 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 13:43:56,699 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=297, Invalid=2150, Unknown=3, NotChecked=0, Total=2450 [2019-10-07 13:43:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 13:43:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-07 13:43:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:43:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-07 13:43:56,706 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2019-10-07 13:43:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:56,707 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-07 13:43:56,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-07 13:43:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-07 13:43:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:43:56,708 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:56,708 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:56,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:56,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash -321146482, now seen corresponding path program 5 times [2019-10-07 13:43:56,910 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:56,910 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:56,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:56,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:43:56,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:56,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:56,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:57,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 13:43:57,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:57,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 13:43:57,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:43:57,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:43:57,173 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:57,174 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:43:57,174 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:57,175 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:57,175 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:57,175 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:57,193 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:43:57,453 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:43:57,494 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:43:57,496 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:57,496 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:57,496 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:43:57,496 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:43:57,496 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,497 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:43:57,498 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:43:58,302 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:58,303 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 13] total 29 [2019-10-07 13:43:58,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 13:43:58,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 13:43:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:43:58,305 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2019-10-07 13:43:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:59,891 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-07 13:43:59,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-07 13:43:59,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-10-07 13:43:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:59,893 INFO L225 Difference]: With dead ends: 53 [2019-10-07 13:43:59,893 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 13:43:59,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2019-10-07 13:43:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 13:43:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-07 13:43:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 13:43:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-07 13:43:59,904 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-10-07 13:43:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:59,904 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-07 13:43:59,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 13:43:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-07 13:43:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:43:59,905 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:59,906 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:00,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:00,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1641197746, now seen corresponding path program 6 times [2019-10-07 13:44:00,110 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:00,110 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:00,110 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:00,110 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:44:00,241 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:00,241 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:00,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:00,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:44:00,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:44:00,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 13:44:00,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:44:00,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:44:00,746 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:00,747 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:44:00,747 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:00,748 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:00,748 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:00,748 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:00,790 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:44:01,062 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:44:01,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:44:01,089 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:01,089 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:01,089 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:44:01,089 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:01,089 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,089 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:01,090 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:01,091 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:44:01,091 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:44:01,091 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:02,112 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:02,113 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 13] total 40 [2019-10-07 13:44:02,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 13:44:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 13:44:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1435, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 13:44:02,115 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 40 states. [2019-10-07 13:44:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:04,333 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-07 13:44:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-07 13:44:04,333 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 37 [2019-10-07 13:44:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:04,335 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:44:04,335 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 13:44:04,337 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=378, Invalid=3404, Unknown=0, NotChecked=0, Total=3782 [2019-10-07 13:44:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 13:44:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-07 13:44:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:44:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-07 13:44:04,345 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 37 [2019-10-07 13:44:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:04,345 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-07 13:44:04,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 13:44:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-07 13:44:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:44:04,347 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:04,347 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:04,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:04,551 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1909758302, now seen corresponding path program 7 times [2019-10-07 13:44:04,552 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:04,552 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:04,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:04,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:04,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:04,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:04,650 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:44:04,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:04,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:04,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:04,920 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:44:04,920 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:04,920 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:04,920 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:04,921 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:04,935 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:44:05,204 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:44:05,233 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:44:05,237 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:05,237 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:05,237 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:44:05,238 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:05,238 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,238 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0))) (<= main_~n~0 1000)) [2019-10-07 13:44:05,239 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 (+ main_~n~0 2147483648)) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,239 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:05,239 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:05,239 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,240 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,240 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,240 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,240 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:05,241 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:05,241 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:44:05,241 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:44:05,242 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:06,266 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:06,266 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 13] total 32 [2019-10-07 13:44:06,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 13:44:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 13:44:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-10-07 13:44:06,269 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 32 states. [2019-10-07 13:44:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:08,146 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-10-07 13:44:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 13:44:08,146 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-10-07 13:44:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:08,148 INFO L225 Difference]: With dead ends: 60 [2019-10-07 13:44:08,148 INFO L226 Difference]: Without dead ends: 38 [2019-10-07 13:44:08,150 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 106 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-10-07 13:44:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-07 13:44:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-07 13:44:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-07 13:44:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-07 13:44:08,158 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 44 [2019-10-07 13:44:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:08,158 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-07 13:44:08,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 13:44:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-07 13:44:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:44:08,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:08,160 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:08,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:08,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1795410814, now seen corresponding path program 8 times [2019-10-07 13:44:08,365 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:08,365 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:08,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:08,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:08,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:08,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:08,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:08,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 13:44:08,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:44:08,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 13:44:08,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:09,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:44:10,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:10,021 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-07 13:44:10,021 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:10,021 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:10,021 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:10,021 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:10,038 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:44:10,300 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-07 13:44:10,324 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:44:10,327 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:10,327 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:10,327 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 174#(and (or (and (= |#NULL.base| 0) (not (< main_~i~0 main_~n~0)) (= |main_#t~malloc2.offset| 0) (= main_~i~1 0) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |main_#t~malloc2.offset| 0) (<= 1 main_~i~1) (= |#NULL.offset| 0))) (or (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 1 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) (and (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~i~1 0) (<= 0 main_~x~0.offset) (<= main_~n~0 1000)))) [2019-10-07 13:44:10,328 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:10,328 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 194#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:10,328 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 76#(and (or (and (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= (store |old(#length)| |main_#t~malloc2.base| (* 4 main_~n~0)) |#length|) (= main_~x~0.offset |main_#t~malloc2.offset|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~x~0.base) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (= |main_#t~malloc2.offset| 0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~x~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~n~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (<= 0 (+ main_~n~0 2147483648)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 165#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~mem5|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (= 0 |main_#t~mem5|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_#t~mem5| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 153#(and (= |#NULL.base| 0) (<= 0 main_~n~0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= main_~x~0.offset 0) (<= 0 |#NULL.base|) (<= 0 main_~i~1) (= |main_#t~malloc2.offset| 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0.offset) (= |#NULL.offset| 0) (<= main_~n~0 1000)) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location L5-2 satisfy 189#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:10,329 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:44:10,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:10,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:10,330 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 199#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:10,330 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 184#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:44:10,330 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:44:10,331 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 204#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:11,497 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:11,497 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16, 13] total 49 [2019-10-07 13:44:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-07 13:44:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-07 13:44:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2153, Unknown=0, NotChecked=0, Total=2352 [2019-10-07 13:44:11,500 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 49 states. [2019-10-07 13:44:14,091 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-07 13:44:14,741 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-07 13:44:15,425 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-07 13:44:15,729 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-07 13:44:19,113 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-07 13:44:20,131 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-07 13:44:20,755 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-07 13:44:20,912 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-07 13:44:21,083 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-07 13:44:21,513 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-07 13:44:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:21,517 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2019-10-07 13:44:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-07 13:44:21,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-10-07 13:44:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:21,517 INFO L225 Difference]: With dead ends: 57 [2019-10-07 13:44:21,518 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:44:21,521 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 91 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=738, Invalid=6234, Unknown=0, NotChecked=0, Total=6972 [2019-10-07 13:44:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:44:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:44:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:44:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:44:21,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-10-07 13:44:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:21,522 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:44:21,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-07 13:44:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:44:21,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:44:21,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:21,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:44:21,846 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 168 [2019-10-07 13:44:24,699 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 176 DAG size of output: 95 [2019-10-07 13:44:29,108 WARN L191 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-10-07 13:44:33,190 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2019-10-07 13:44:34,151 WARN L191 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 96 [2019-10-07 13:44:34,154 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:34,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:34,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:34,154 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 13:44:34,155 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:44:34,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:44:34,155 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 19) no Hoare annotation was computed. [2019-10-07 13:44:34,155 INFO L439 ceAbstractionStarter]: At program point L17-2(line 17) the Hoare annotation is: (let ((.cse14 (select |#memory_int| main_~x~0.base))) (let ((.cse19 (select .cse14 (+ (* 4 main_~i~1) main_~x~0.offset)))) (let ((.cse11 (<= |#NULL.base| 0)) (.cse13 (= 0 .cse19)) (.cse17 (= 0 (select |#valid| 0))) (.cse4 (<= 0 |#NULL.base|)) (.cse18 (= |main_#t~malloc2.offset| 0)) (.cse15 (= main_~i~1 0)) (.cse16 (<= main_~n~0 1000))) (let ((.cse0 (and .cse13 .cse17 (= main_~x~0.offset 0) .cse4 .cse18 (< main_~i~1 main_~n~0) .cse15 (= |main_#t~mem5| .cse19) .cse16)) (.cse8 (<= main_~i~0 3)) (.cse9 (<= main_~n~0 3)) (.cse5 (= (select .cse14 (+ main_~x~0.offset 8)) 0)) (.cse3 (<= main_~n~0 main_~i~0)) (.cse1 (<= main_~i~0 2)) (.cse6 (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= main_~x~0.offset 0) .cse11 .cse17 .cse4 .cse18 (= (select .cse14 main_~x~0.offset) 0))) (.cse7 (= 0 |main_#t~mem5|)) (.cse12 (= main_~i~1 1)) (.cse10 (<= 0 main_~x~0.offset)) (.cse2 (= (select .cse14 (+ main_~x~0.offset 4)) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.offset| 0)) (not .cse4) (not (<= 0 |#NULL.offset|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 main_~i~1) .cse10 .cse2) (and .cse0 (<= main_~i~0 1) .cse3) (and .cse5 .cse0 .cse8 .cse2 .cse3) (not .cse11) (and .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse2) (and .cse5 .cse6 (forall ((v_main_~i~1_86 Int)) (or (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~1_86)))) (< v_main_~i~1_86 (+ main_~i~1 1)) (<= main_~n~0 v_main_~i~1_86))) .cse7 .cse13 (forall ((v_main_~i~1_86 Int)) (or (< v_main_~i~1_86 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~1_86)))) (< main_~i~0 (+ v_main_~i~1_86 1)))) .cse10 .cse2 (= 0 (select .cse14 (+ main_~x~0.offset 12))) (or (and .cse15 .cse3) (<= 1 main_~i~1)) .cse16) (and .cse1 .cse6 .cse7 .cse12 (<= main_~n~0 2) .cse10 .cse2)))))) [2019-10-07 13:44:34,155 INFO L443 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. [2019-10-07 13:44:34,155 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 19) no Hoare annotation was computed. [2019-10-07 13:44:34,155 INFO L439 ceAbstractionStarter]: At program point L17-5(line 17) the Hoare annotation is: (let ((.cse11 (<= 0 main_~n~0)) (.cse7 (<= |#NULL.base| 0)) (.cse13 (= 0 (select |#valid| 0))) (.cse6 (<= 0 |#NULL.base|)) (.cse14 (= |main_#t~malloc2.offset| 0)) (.cse10 (= main_~i~1 0)) (.cse15 (<= main_~n~0 main_~i~0)) (.cse9 (<= 1 main_~i~1)) (.cse16 (select |#memory_int| main_~x~0.base))) (let ((.cse8 (<= main_~i~0 1)) (.cse0 (= (select .cse16 (+ main_~x~0.offset 8)) 0)) (.cse12 (= 0 (select .cse16 (+ (* 4 main_~i~1) main_~x~0.offset)))) (.cse4 (forall ((v_main_~i~1_86 Int)) (or (< v_main_~i~1_86 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~1_86)))) (< main_~i~0 (+ v_main_~i~1_86 1))))) (.cse5 (= 0 (select .cse16 (+ main_~x~0.offset 12)))) (.cse1 (= (select .cse16 (+ main_~x~0.offset 4)) 0)) (.cse2 (or (and .cse10 .cse15) .cse9)) (.cse3 (and .cse11 (<= 0 main_~i~0) (<= main_~x~0.offset 0) .cse7 .cse13 .cse6 .cse14 (<= 0 main_~x~0.offset) (= (select .cse16 main_~x~0.offset) 0) (= |#NULL.offset| 0) (<= main_~n~0 1000)))) (or (not (= 0 (select |old(#valid)| 0))) (and .cse0 (<= main_~i~0 3) (<= main_~n~0 3) .cse1 .cse2 .cse3) (not (<= |#NULL.offset| 0)) (and .cse0 (<= main_~n~0 main_~i~1) .cse4 .cse1 .cse5 .cse3) (not .cse6) (not (<= 0 |#NULL.offset|)) (not .cse7) (and .cse8 .cse9 (<= main_~n~0 1) .cse3) (and (<= main_~n~0 0) .cse10 (= main_~i~0 0)) (and .cse8 (and .cse11 .cse12 .cse13 (= main_~x~0.offset 0) .cse14) .cse10 .cse15) (and .cse0 (forall ((v_main_~i~1_86 Int)) (or (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~1_86)))) (< v_main_~i~1_86 (+ main_~i~1 1)) (<= main_~n~0 v_main_~i~1_86))) .cse12 .cse4 .cse1 .cse5 .cse2 .cse3) (and (<= main_~i~0 2) (<= main_~n~0 2) .cse1 .cse2 .cse3)))) [2019-10-07 13:44:34,156 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 12 19) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-07 13:44:34,156 INFO L439 ceAbstractionStarter]: At program point L16-3(line 16) the Hoare annotation is: (let ((.cse8 (<= 0 main_~n~0)) (.cse7 (<= |#NULL.base| 0)) (.cse10 (= 0 (select |#valid| 0))) (.cse6 (<= 0 |#NULL.base|)) (.cse9 (= |main_#t~malloc2.offset| 0)) (.cse4 (select |#memory_int| main_~x~0.base))) (let ((.cse0 (= (select .cse4 (+ main_~x~0.offset 8)) 0)) (.cse1 (and .cse8 (<= 0 main_~i~0) .cse7 .cse10 .cse6 .cse9 (= (select .cse4 main_~x~0.offset) 0))) (.cse3 (= (select .cse4 (+ main_~x~0.offset 4)) 0)) (.cse2 (= main_~x~0.offset 0)) (.cse5 (<= main_~n~0 1000))) (or (and .cse0 (forall ((v_main_~i~1_86 Int)) (or (< v_main_~i~1_86 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~1_86)))) (< main_~i~0 (+ v_main_~i~1_86 1)))) .cse1 .cse2 .cse3 (= 0 (select .cse4 (+ main_~x~0.offset 12))) .cse5) (not (<= |#NULL.offset| 0)) (and .cse1 .cse2 (<= main_~i~0 1) .cse5) (not .cse6) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not .cse7) (and .cse0 .cse1 .cse2 (<= main_~i~0 3) .cse3 .cse5) (and (<= main_~i~0 2) .cse1 .cse2 (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_31 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_31 8)))) .cse3 .cse5) (and .cse8 .cse2 .cse9 .cse10 (= main_~i~0 0) .cse5)))) [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-07 13:44:34,156 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-10-07 13:44:34,156 INFO L443 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2019-10-07 13:44:34,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] [2019-10-07 13:44:34,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] [2019-10-07 13:44:34,214 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,214 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,214 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,216 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,217 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] [2019-10-07 13:44:34,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] [2019-10-07 13:44:34,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:44:34 BoogieIcfgContainer [2019-10-07 13:44:34,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:44:34,233 INFO L168 Benchmark]: Toolchain (without parser) took 67415.39 ms. Allocated memory was 137.4 MB in the beginning and 470.3 MB in the end (delta: 332.9 MB). Free memory was 101.9 MB in the beginning and 172.4 MB in the end (delta: -70.5 MB). Peak memory consumption was 347.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:34,233 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 13:44:34,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.35 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:34,234 INFO L168 Benchmark]: Boogie Preprocessor took 116.32 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.8 MB in the beginning and 178.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:34,235 INFO L168 Benchmark]: RCFGBuilder took 399.43 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 161.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:34,236 INFO L168 Benchmark]: TraceAbstraction took 66649.77 ms. Allocated memory was 200.8 MB in the beginning and 470.3 MB in the end (delta: 269.5 MB). Free memory was 161.6 MB in the beginning and 172.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:34,237 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.35 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.32 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.8 MB in the beginning and 178.3 MB in the end (delta: -86.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.43 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 161.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66649.77 ms. Allocated memory was 200.8 MB in the beginning and 470.3 MB in the end (delta: 269.5 MB). Free memory was 161.6 MB in the beginning and 172.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2019-10-07 13:44:34,247 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,248 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,249 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,251 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,252 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,253 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,260 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,264 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((((!(0 == \old(\valid)[0]) || (((((unknown-#memory_int-unknown[x][x + 8] == 0 && i <= 3) && n <= 3) && unknown-#memory_int-unknown[x][x + 4] == 0) && ((i == 0 && n <= i) || 1 <= i)) && (((((((((0 <= n && 0 <= i) && x <= 0) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && 0 <= x) && unknown-#memory_int-unknown[x][x] == 0) && #NULL == 0) && n <= 1000)) || !(#NULL <= 0)) || (((((unknown-#memory_int-unknown[x][x + 8] == 0 && n <= i) && (forall v_main_~i~1_86 : int :: (v_main_~i~1_86 < 4 || 0 == unknown-#memory_int-unknown[x][x + 4 * v_main_~i~1_86]) || i < v_main_~i~1_86 + 1)) && unknown-#memory_int-unknown[x][x + 4] == 0) && 0 == unknown-#memory_int-unknown[x][x + 12]) && (((((((((0 <= n && 0 <= i) && x <= 0) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && 0 <= x) && unknown-#memory_int-unknown[x][x] == 0) && #NULL == 0) && n <= 1000)) || !(0 <= #NULL)) || !(0 <= #NULL)) || !(#NULL <= 0)) || (((i <= 1 && 1 <= i) && n <= 1) && (((((((((0 <= n && 0 <= i) && x <= 0) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && 0 <= x) && unknown-#memory_int-unknown[x][x] == 0) && #NULL == 0) && n <= 1000)) || ((n <= 0 && i == 0) && i == 0)) || (((i <= 1 && (((0 <= n && 0 == unknown-#memory_int-unknown[x][4 * i + x]) && 0 == \valid[0]) && x == 0) && malloc(n * sizeof(int)) == 0) && i == 0) && n <= i)) || (((((((unknown-#memory_int-unknown[x][x + 8] == 0 && (forall v_main_~i~1_86 : int :: (0 == unknown-#memory_int-unknown[x][x + 4 * v_main_~i~1_86] || v_main_~i~1_86 < i + 1) || n <= v_main_~i~1_86)) && 0 == unknown-#memory_int-unknown[x][4 * i + x]) && (forall v_main_~i~1_86 : int :: (v_main_~i~1_86 < 4 || 0 == unknown-#memory_int-unknown[x][x + 4 * v_main_~i~1_86]) || i < v_main_~i~1_86 + 1)) && unknown-#memory_int-unknown[x][x + 4] == 0) && 0 == unknown-#memory_int-unknown[x][x + 12]) && ((i == 0 && n <= i) || 1 <= i)) && (((((((((0 <= n && 0 <= i) && x <= 0) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && 0 <= x) && unknown-#memory_int-unknown[x][x] == 0) && #NULL == 0) && n <= 1000)) || ((((i <= 2 && n <= 2) && unknown-#memory_int-unknown[x][x + 4] == 0) && ((i == 0 && n <= i) || 1 <= i)) && (((((((((0 <= n && 0 <= i) && x <= 0) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && 0 <= x) && unknown-#memory_int-unknown[x][x] == 0) && #NULL == 0) && n <= 1000) - InvariantResult [Line: 16]: Loop Invariant [2019-10-07 13:44:34,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] [2019-10-07 13:44:34,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] [2019-10-07 13:44:34,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,275 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2019-10-07 13:44:34,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.base_BEFORE_CALL_16,QUANTIFIED] [2019-10-07 13:44:34,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0.offset_BEFORE_CALL_31,QUANTIFIED] [2019-10-07 13:44:34,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,278 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,279 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,280 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:34,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:34,281 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((((unknown-#memory_int-unknown[x][x + 8] == 0 && (forall v_main_~i~1_86 : int :: (v_main_~i~1_86 < 4 || 0 == unknown-#memory_int-unknown[x][x + 4 * v_main_~i~1_86]) || i < v_main_~i~1_86 + 1)) && (((((0 <= n && 0 <= i) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && unknown-#memory_int-unknown[x][x] == 0) && x == 0) && unknown-#memory_int-unknown[x][x + 4] == 0) && 0 == unknown-#memory_int-unknown[x][x + 12]) && n <= 1000) || !(#NULL <= 0)) || (((((((((0 <= n && 0 <= i) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && unknown-#memory_int-unknown[x][x] == 0) && x == 0) && i <= 1) && n <= 1000)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0)) || (((((unknown-#memory_int-unknown[x][x + 8] == 0 && (((((0 <= n && 0 <= i) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && unknown-#memory_int-unknown[x][x] == 0) && x == 0) && i <= 3) && unknown-#memory_int-unknown[x][x + 4] == 0) && n <= 1000)) || (((((i <= 2 && (((((0 <= n && 0 <= i) && #NULL <= 0) && 0 == \valid[0]) && 0 <= #NULL) && malloc(n * sizeof(int)) == 0) && unknown-#memory_int-unknown[x][x] == 0) && x == 0) && (\exists v_main_~x~0.base_BEFORE_CALL_16 : int, v_main_~x~0.offset_BEFORE_CALL_31 : int :: 0 == unknown-#memory_int-unknown[v_main_~x~0.base_BEFORE_CALL_16][v_main_~x~0.offset_BEFORE_CALL_31 + 8])) && unknown-#memory_int-unknown[x][x + 4] == 0) && n <= 1000)) || (((((0 <= n && x == 0) && malloc(n * sizeof(int)) == 0) && 0 == \valid[0]) && i == 0) && n <= 1000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 66.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.4s, HoareTripleCheckerStatistics: 100 SDtfs, 511 SDslu, 525 SDs, 0 SdLazy, 3528 SolverSat, 648 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 595 SyntacticMatches, 52 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5746 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 32 PreInvPairs, 85 NumberOfFragments, 1354 HoareAnnotationTreeSize, 32 FomulaSimplifications, 2337 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 9966 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 803 ConstructedInterpolants, 67 QuantifiedInterpolants, 130781 SizeOfPredicates, 67 NumberOfNonLiveVariables, 929 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 508/825 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 4049, ICFG_INTERPRETER_ENTERED_PROCEDURES: 36, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 407, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 204, TOOLS_POST_TIME[ms]: 272, TOOLS_POST_CALL_APPLICATIONS: 109, TOOLS_POST_CALL_TIME[ms]: 344, TOOLS_POST_RETURN_APPLICATIONS: 82, TOOLS_POST_RETURN_TIME[ms]: 62, TOOLS_QUANTIFIERELIM_APPLICATIONS: 395, TOOLS_QUANTIFIERELIM_TIME[ms]: 588, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 37, FLUID_QUERY_TIME[ms]: 17, FLUID_QUERIES: 458, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 292, DOMAIN_JOIN_TIME[ms]: 2195, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 34, DOMAIN_WIDEN_TIME[ms]: 679, DOMAIN_ISSUBSETEQ_APPLICATIONS: 51, DOMAIN_ISSUBSETEQ_TIME[ms]: 125, DOMAIN_ISBOTTOM_APPLICATIONS: 49, DOMAIN_ISBOTTOM_TIME[ms]: 96, LOOP_SUMMARIZER_APPLICATIONS: 17, LOOP_SUMMARIZER_CACHE_MISSES: 17, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2359, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2358, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 51, CALL_SUMMARIZER_APPLICATIONS: 82, CALL_SUMMARIZER_CACHE_MISSES: 17, CALL_SUMMARIZER_OVERALL_TIME[ms]: 161, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 160, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 8, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 8, DAG_COMPRESSION_TIME[ms]: 59, DAG_COMPRESSION_PROCESSED_NODES: 933, DAG_COMPRESSION_RETAINED_NODES: 501, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...