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/array-examples/standard_two_index_08.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:29:00,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:29:00,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:29:00,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:29:00,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:29:00,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:29:00,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:29:00,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:29:00,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:29:00,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:29:00,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:29:00,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:29:00,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:29:00,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:29:00,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:29:00,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:29:00,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:29:00,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:29:00,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:29:00,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:29:00,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:29:00,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:29:00,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:29:00,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:29:00,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:29:00,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:29:00,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:29:00,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:29:00,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:29:00,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:29:00,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:29:00,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:29:00,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:29:00,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:29:00,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:29:00,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:29:00,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:29:00,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:29:00,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:29:00,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:29:00,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:29:00,090 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 00:29:00,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:29:00,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:29:00,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:29:00,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:29:00,129 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:29:00,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:29:00,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:29:00,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:29:00,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:29:00,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:29:00,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:29:00,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:29:00,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:29:00,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:29:00,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:29:00,133 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:29:00,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:29:00,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:29:00,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:29:00,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:29:00,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:29:00,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:29:00,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:29:00,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:29:00,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:29:00,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:29:00,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:29:00,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:29:00,137 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 00:29:00,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:29:00,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:29:00,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:29:00,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:29:00,453 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:29:00,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-07 00:29:00,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce71a9b1/66d29e847ad3496d8eb35e46d0f95fad/FLAGba8ac1a4d [2019-10-07 00:29:00,983 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:29:00,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_08.i [2019-10-07 00:29:00,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce71a9b1/66d29e847ad3496d8eb35e46d0f95fad/FLAGba8ac1a4d [2019-10-07 00:29:01,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce71a9b1/66d29e847ad3496d8eb35e46d0f95fad [2019-10-07 00:29:01,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:29:01,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:29:01,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:29:01,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:29:01,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:29:01,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5d6786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01, skipping insertion in model container [2019-10-07 00:29:01,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,363 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:29:01,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:29:01,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:29:01,548 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:29:01,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:29:01,584 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:29:01,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01 WrapperNode [2019-10-07 00:29:01,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:29:01,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:29:01,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:29:01,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:29:01,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (1/1) ... [2019-10-07 00:29:01,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:29:01,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:29:01,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:29:01,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:29:01,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (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 00:29:01,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:29:01,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:29:01,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:29:01,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:29:01,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:29:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:29:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:29:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:29:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:29:02,073 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:29:02,073 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:29:02,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:29:02 BoogieIcfgContainer [2019-10-07 00:29:02,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:29:02,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:29:02,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:29:02,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:29:02,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:29:01" (1/3) ... [2019-10-07 00:29:02,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668f69cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:29:02, skipping insertion in model container [2019-10-07 00:29:02,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:01" (2/3) ... [2019-10-07 00:29:02,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668f69cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:29:02, skipping insertion in model container [2019-10-07 00:29:02,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:29:02" (3/3) ... [2019-10-07 00:29:02,082 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_08.i [2019-10-07 00:29:02,091 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:29:02,097 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:29:02,106 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:29:02,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:29:02,133 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:29:02,133 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:29:02,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:29:02,134 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:29:02,134 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:29:02,134 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:29:02,134 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:29:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:29:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:29:02,155 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:02,156 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:02,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:02,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:29:02,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:02,169 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,169 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,169 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:02,325 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 00:29:02,326 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,326 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:29:02,327 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:29:02,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:29:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:29:02,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:29:02,342 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:29:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:02,396 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:29:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:29:02,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:29:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:02,404 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:29:02,405 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:29:02,407 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:29:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:29:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:29:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:29:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:29:02,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:29:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:02,440 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:29:02,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:29:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:29:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:29:02,441 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:02,441 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:02,441 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-07 00:29:02,442 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:02,442 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,443 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,443 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:29:02,493 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,493 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:29:02,494 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:29:02,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:29:02,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:29:02,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:29:02,496 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:29:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:02,533 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-07 00:29:02,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:29:02,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:29:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:02,537 INFO L225 Difference]: With dead ends: 30 [2019-10-07 00:29:02,537 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:29:02,539 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:29:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:29:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:29:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:29:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:29:02,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:29:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:02,553 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:29:02,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:29:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:29:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:29:02,555 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:02,556 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:02,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:29:02,557 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:02,557 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,558 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,558 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:29:02,640 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:02,640 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:02,640 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 00:29:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:02,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:29:02,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:29:02,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:29:02,786 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:02,808 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:02,809 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:02,814 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:02,821 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:02,822 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:03,003 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:03,530 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:03,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:03,574 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:03,575 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:03,575 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:03,576 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:03,576 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 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 00:29:03,577 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 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 00:29:03,577 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:03,577 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:03,578 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:03,578 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 00:29:03,578 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 00:29:03,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:03,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:03,580 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:03,581 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-07 00:29:03,879 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:03,879 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-07 00:29:03,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 00:29:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 00:29:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-07 00:29:03,883 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-07 00:29:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:04,616 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-07 00:29:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:29:04,617 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 00:29:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:04,618 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:29:04,618 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:29:04,620 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:29:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:29:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-07 00:29:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:29:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:29:04,628 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-07 00:29:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:04,628 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:29:04,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 00:29:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:29:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:29:04,629 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:04,630 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:04,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:04,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-07 00:29:04,843 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:04,844 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:04,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:04,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:29:04,922 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:04,922 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:04,922 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 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 00:29:04,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:29:04,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:04,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 00:29:04,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:29:04,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:29:05,026 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:05,027 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:05,027 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:05,027 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:05,028 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:05,028 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:05,069 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:05,408 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:05,419 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:05,424 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:05,424 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:05,425 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:05,425 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:05,425 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:05,425 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:05,426 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:05,426 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:05,426 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:05,426 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 00:29:05,427 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 00:29:05,427 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:05,427 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:05,427 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:05,428 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-07 00:29:05,707 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:05,707 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-07 00:29:05,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:29:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:29:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:29:05,709 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-07 00:29:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:06,642 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-07 00:29:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:29:06,643 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-07 00:29:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:06,644 INFO L225 Difference]: With dead ends: 73 [2019-10-07 00:29:06,645 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 00:29:06,646 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:29:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 00:29:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-07 00:29:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:29:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:29:06,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-07 00:29:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:06,656 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:29:06,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:29:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:29:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:29:06,657 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:06,657 INFO L385 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:06,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:06,863 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-07 00:29:06,864 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:06,864 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:06,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:06,864 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:29:07,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:07,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:07,024 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 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 00:29:07,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:29:07,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 00:29:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:29:07,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:29:07,362 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:07,363 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:07,363 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:07,364 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:07,364 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:07,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:07,395 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:07,655 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:07,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:07,672 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:07,672 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:07,673 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:07,673 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:07,673 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 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 00:29:07,674 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 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 00:29:07,674 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:07,674 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:07,675 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:07,675 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 00:29:07,675 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 00:29:07,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:07,676 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:07,676 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:07,676 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:29:07,972 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:07,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 39 [2019-10-07 00:29:07,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:29:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:29:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=995, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:29:07,976 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-07 00:29:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:09,853 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2019-10-07 00:29:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:29:09,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-07 00:29:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:09,855 INFO L225 Difference]: With dead ends: 108 [2019-10-07 00:29:09,855 INFO L226 Difference]: Without dead ends: 90 [2019-10-07 00:29:09,859 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1816, Invalid=4990, Unknown=0, NotChecked=0, Total=6806 [2019-10-07 00:29:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-07 00:29:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2019-10-07 00:29:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 00:29:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-07 00:29:09,872 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 28 [2019-10-07 00:29:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:09,872 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-07 00:29:09,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:29:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-07 00:29:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 00:29:09,874 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:09,874 INFO L385 BasicCegarLoop]: trace histogram [26, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:10,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:10,078 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1394133595, now seen corresponding path program 4 times [2019-10-07 00:29:10,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:10,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:10,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:10,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:29:10,328 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:10,329 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:10,329 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 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 00:29:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:10,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-07 00:29:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:29:10,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:29:11,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:11,351 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:11,351 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:11,351 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:11,352 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:11,352 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:11,389 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:11,659 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-07 00:29:11,719 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:11,727 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:11,732 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:11,732 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:11,732 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:11,732 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:11,733 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 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 00:29:11,733 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 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 00:29:11,733 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:11,733 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:11,734 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:11,734 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 00:29:11,734 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 00:29:11,734 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:11,734 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:11,735 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:11,735 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:29:12,014 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:12,014 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 29, 29, 11] total 75 [2019-10-07 00:29:12,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-07 00:29:12,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-07 00:29:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2233, Invalid=3317, Unknown=0, NotChecked=0, Total=5550 [2019-10-07 00:29:12,019 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 75 states. [2019-10-07 00:29:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:16,561 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2019-10-07 00:29:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-07 00:29:16,562 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 49 [2019-10-07 00:29:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:16,564 INFO L225 Difference]: With dead ends: 169 [2019-10-07 00:29:16,564 INFO L226 Difference]: Without dead ends: 148 [2019-10-07 00:29:16,574 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9281 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7837, Invalid=17923, Unknown=0, NotChecked=0, Total=25760 [2019-10-07 00:29:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-07 00:29:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 94. [2019-10-07 00:29:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-07 00:29:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-07 00:29:16,612 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 49 [2019-10-07 00:29:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-07 00:29:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-07 00:29:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-07 00:29:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 00:29:16,617 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:16,617 INFO L385 BasicCegarLoop]: trace histogram [62, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:16,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:16,821 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1422778532, now seen corresponding path program 5 times [2019-10-07 00:29:16,822 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:16,822 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:16,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:16,822 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:29:17,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:17,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:17,137 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 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 00:29:21,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-07 00:29:21,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:21,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-07 00:29:21,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:29:21,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:29:22,162 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:22,163 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:22,164 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:22,164 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:22,164 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:22,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:22,185 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:22,421 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:22,427 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:22,430 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:22,430 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:22,431 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:22,431 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:22,431 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:22,431 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:22,431 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:22,432 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:22,432 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:22,432 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 00:29:22,432 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 00:29:22,432 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:22,433 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:22,433 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:22,433 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:29:22,728 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:22,728 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 47 [2019-10-07 00:29:22,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-07 00:29:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-07 00:29:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=1396, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:29:22,730 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2019-10-07 00:29:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:26,441 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2019-10-07 00:29:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-07 00:29:26,442 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-10-07 00:29:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:26,446 INFO L225 Difference]: With dead ends: 227 [2019-10-07 00:29:26,446 INFO L226 Difference]: Without dead ends: 218 [2019-10-07 00:29:26,450 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4206, Invalid=10556, Unknown=0, NotChecked=0, Total=14762 [2019-10-07 00:29:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-07 00:29:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 112. [2019-10-07 00:29:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-07 00:29:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-10-07 00:29:26,483 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 90 [2019-10-07 00:29:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:26,484 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-10-07 00:29:26,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-07 00:29:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-10-07 00:29:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 00:29:26,486 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:26,486 INFO L385 BasicCegarLoop]: trace histogram [62, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:26,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:26,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1547036028, now seen corresponding path program 6 times [2019-10-07 00:29:26,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:26,695 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:26,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:26,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:26,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-10-07 00:29:27,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:27,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:27,399 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 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 00:29:27,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:29:27,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:27,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-07 00:29:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:29:28,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:29:31,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:31,037 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:31,037 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:31,037 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:31,038 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:31,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:31,061 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:31,295 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:29:31,301 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:31,305 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:31,305 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:31,305 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:31,306 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:31,306 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 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 00:29:31,306 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __VERIFIER_assert_~cond 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 00:29:31,306 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:31,306 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:29:31,307 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:29:31,307 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 00:29:31,307 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 00:29:31,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:29:31,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:31,308 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:31,308 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-07 00:29:31,693 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:31,693 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 65, 65, 11] total 166 [2019-10-07 00:29:31,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-10-07 00:29:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-10-07 00:29:31,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12425, Invalid=14965, Unknown=0, NotChecked=0, Total=27390 [2019-10-07 00:29:31,699 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 166 states. [2019-10-07 00:29:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:51,248 INFO L93 Difference]: Finished difference Result 391 states and 536 transitions. [2019-10-07 00:29:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2019-10-07 00:29:51,248 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 108 [2019-10-07 00:29:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:51,255 INFO L225 Difference]: With dead ends: 391 [2019-10-07 00:29:51,255 INFO L226 Difference]: Without dead ends: 347 [2019-10-07 00:29:51,277 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48861 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=44916, Invalid=91614, Unknown=0, NotChecked=0, Total=136530 [2019-10-07 00:29:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-10-07 00:29:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 212. [2019-10-07 00:29:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-07 00:29:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2019-10-07 00:29:51,353 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 108 [2019-10-07 00:29:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:51,354 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2019-10-07 00:29:51,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-10-07 00:29:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2019-10-07 00:29:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-07 00:29:51,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:51,373 INFO L385 BasicCegarLoop]: trace histogram [153, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:51,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:51,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 911550361, now seen corresponding path program 7 times [2019-10-07 00:29:51,580 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:51,580 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:51,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:51,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12727 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 11781 trivial. 0 not checked. [2019-10-07 00:29:52,854 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:52,854 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:52,854 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 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 00:29:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:53,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 155 conjunts are in the unsatisfiable core [2019-10-07 00:29:53,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12727 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-07 00:29:54,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12727 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-07 00:30:07,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:07,972 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:30:07,972 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:07,973 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:07,973 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:07,973 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:07,991 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:08,240 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-07 00:30:08,246 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:08,249 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:08,249 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:08,249 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:08,249 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:30:08,250 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:08,250 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:08,250 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:08,250 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-07 00:30:08,250 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (< main_~i~0 100000) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 32 main_~j~0) |main_~#b~0.offset| 4)) |main_#t~mem3|) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-07 00:30:08,251 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 00:30:08,251 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 00:30:08,251 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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 00:30:08,251 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:08,251 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:30:08,252 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_7| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) (+ v_prenex_25 4)) (select (select |#memory_int| v_prenex_27) v_prenex_26)))))) [2019-10-07 00:30:08,707 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:08,708 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 156, 156, 11] total 345 [2019-10-07 00:30:08,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 345 states [2019-10-07 00:30:08,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 345 interpolants. [2019-10-07 00:30:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56638, Invalid=62042, Unknown=0, NotChecked=0, Total=118680 [2019-10-07 00:30:08,725 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 345 states. [2019-10-07 00:31:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:31:11,294 INFO L93 Difference]: Finished difference Result 663 states and 929 transitions. [2019-10-07 00:31:11,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 409 states. [2019-10-07 00:31:11,294 INFO L78 Accepts]: Start accepts. Automaton has 345 states. Word has length 208 [2019-10-07 00:31:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:31:11,298 INFO L225 Difference]: With dead ends: 663 [2019-10-07 00:31:11,299 INFO L226 Difference]: Without dead ends: 610 [2019-10-07 00:31:11,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212944 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=193088, Invalid=367164, Unknown=0, NotChecked=0, Total=560252 [2019-10-07 00:31:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-07 00:31:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 412. [2019-10-07 00:31:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-07 00:31:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 414 transitions. [2019-10-07 00:31:11,349 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 414 transitions. Word has length 208 [2019-10-07 00:31:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:31:11,350 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 414 transitions. [2019-10-07 00:31:11,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 345 states. [2019-10-07 00:31:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 414 transitions. [2019-10-07 00:31:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-10-07 00:31:11,356 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:31:11,356 INFO L385 BasicCegarLoop]: trace histogram [332, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:31:11,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:11,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:31:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:31:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -860912420, now seen corresponding path program 8 times [2019-10-07 00:31:11,569 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:31:11,569 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:11,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:11,569 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:31:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 57358 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 55278 trivial. 0 not checked. [2019-10-07 00:31:14,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:14,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:31:14,630 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 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