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_minInArray_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:12:25,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:12:25,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:12:25,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:12:25,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:12:25,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:12:25,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:12:25,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:12:25,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:12:25,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:12:25,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:12:25,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:12:25,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:12:25,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:12:25,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:12:25,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:12:25,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:12:25,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:12:25,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:12:25,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:12:25,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:12:25,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:12:25,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:12:25,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:12:25,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:12:25,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:12:25,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:12:25,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:12:25,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:12:25,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:12:25,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:12:25,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:12:25,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:12:25,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:12:25,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:12:25,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:12:25,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:12:25,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:12:25,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:12:25,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:12:25,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:12:25,516 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:12:25,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:12:25,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:12:25,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:12:25,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:12:25,532 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:12:25,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:12:25,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:12:25,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:12:25,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:12:25,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:12:25,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:12:25,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:12:25,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:12:25,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:12:25,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:12:25,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:12:25,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:12:25,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:12:25,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:12:25,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:12:25,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:12:25,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:12:25,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:12:25,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:12:25,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:12:25,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:12:25,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:12:25,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:12:25,537 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:12:25,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:12:25,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:12:25,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:12:25,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:12:25,913 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:12:25,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-10-07 00:12:26,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d23266e1/0653678171484c13ba12ead977b4a98f/FLAG1bdad11f5 [2019-10-07 00:12:26,585 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:12:26,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_ground-1.i [2019-10-07 00:12:26,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d23266e1/0653678171484c13ba12ead977b4a98f/FLAG1bdad11f5 [2019-10-07 00:12:26,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d23266e1/0653678171484c13ba12ead977b4a98f [2019-10-07 00:12:27,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:12:27,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:12:27,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:12:27,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:12:27,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:12:27,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:12:26" (1/1) ... [2019-10-07 00:12:27,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c8f889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27, skipping insertion in model container [2019-10-07 00:12:27,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:12:26" (1/1) ... [2019-10-07 00:12:27,022 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:12:27,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:12:27,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:12:27,295 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:12:27,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:12:27,343 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:12:27,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27 WrapperNode [2019-10-07 00:12:27,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:12:27,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:12:27,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:12:27,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:12:27,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... [2019-10-07 00:12:27,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:12:27,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:12:27,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:12:27,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:12:27,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:12:27,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:12:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:12:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:12:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:12:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:12:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:12:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:12:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:12:27,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:12:27,940 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:12:27,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:12:27 BoogieIcfgContainer [2019-10-07 00:12:27,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:12:27,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:12:27,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:12:27,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:12:27,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:12:26" (1/3) ... [2019-10-07 00:12:27,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc7c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:12:27, skipping insertion in model container [2019-10-07 00:12:27,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:12:27" (2/3) ... [2019-10-07 00:12:27,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fc7c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:12:27, skipping insertion in model container [2019-10-07 00:12:27,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:12:27" (3/3) ... [2019-10-07 00:12:27,950 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_minInArray_ground-1.i [2019-10-07 00:12:27,960 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:12:27,969 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:12:27,981 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:12:28,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:12:28,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:12:28,007 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:12:28,007 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:12:28,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:12:28,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:12:28,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:12:28,008 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:12:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:12:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:12:28,033 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:28,035 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:28,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -493369724, now seen corresponding path program 1 times [2019-10-07 00:12:28,052 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:28,052 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,052 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:28,222 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:12:28,223 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,224 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:12:28,225 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:12:28,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:12:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:12:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:12:28,246 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:12:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:28,281 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:12:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:12:28,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:12:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:28,297 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:12:28,297 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 00:12:28,304 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:12:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 00:12:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 00:12:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 00:12:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-07 00:12:28,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-07 00:12:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:28,340 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-07 00:12:28,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:12:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-07 00:12:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:12:28,342 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:28,342 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:28,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash 937030386, now seen corresponding path program 1 times [2019-10-07 00:12:28,343 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:28,344 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,344 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,344 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:28,435 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:12:28,435 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,436 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:12:28,436 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:12:28,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:12:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:12:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:12:28,439 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-07 00:12:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:28,450 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-07 00:12:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:12:28,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:12:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:28,452 INFO L225 Difference]: With dead ends: 27 [2019-10-07 00:12:28,452 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:12:28,454 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:12:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:12:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:12:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:12:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:12:28,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:12:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:28,460 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:12:28,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:12:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:12:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:12:28,463 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:28,464 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:28,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 76469094, now seen corresponding path program 1 times [2019-10-07 00:12:28,465 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:28,465 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,465 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,465 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:28,522 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:12:28,522 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:28,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:28,523 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:12:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:28,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:12:28,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:28,613 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:12:28,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:28,652 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:12:28,652 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:28,703 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:28,703 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:28,710 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:28,719 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:28,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:28,886 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:29,216 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:29,297 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:29,317 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:29,317 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:29,318 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:29,318 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:29,318 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:29,319 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:29,319 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:29,321 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:29,322 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:12:29,322 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:12:29,322 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:29,323 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:29,323 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:29,323 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:29,323 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:12:29,699 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:29,699 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:12:29,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:12:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:12:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:12:29,702 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-07 00:12:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:30,249 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-07 00:12:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:12:30,250 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-07 00:12:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:30,252 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:12:30,253 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 00:12:30,254 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:12:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 00:12:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-07 00:12:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 00:12:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-07 00:12:30,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-07 00:12:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:30,267 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-07 00:12:30,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:12:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-07 00:12:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 00:12:30,268 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:30,268 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:30,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:30,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash 134362772, now seen corresponding path program 2 times [2019-10-07 00:12:30,483 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:30,483 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:30,483 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:30,484 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:12:30,592 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:30,592 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:30,593 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:12:30,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:12:30,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:30,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:12:30,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:30,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:30,739 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:30,740 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:30,741 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:30,742 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:30,742 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:30,743 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:30,780 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:30,904 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:30,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:30,948 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:30,948 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:30,948 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:30,949 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:30,950 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:30,950 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:30,951 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:30,952 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:30,952 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:12:30,952 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:12:30,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:30,953 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:30,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:30,953 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:30,954 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:31,318 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:31,318 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-07 00:12:31,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:12:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:12:31,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:12:31,320 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2019-10-07 00:12:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:32,026 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-10-07 00:12:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 00:12:32,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-10-07 00:12:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:32,028 INFO L225 Difference]: With dead ends: 39 [2019-10-07 00:12:32,028 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 00:12:32,029 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-07 00:12:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 00:12:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-07 00:12:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:12:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 00:12:32,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2019-10-07 00:12:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:32,037 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 00:12:32,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:12:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 00:12:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:12:32,039 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:32,039 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:32,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:32,244 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash 717812850, now seen corresponding path program 3 times [2019-10-07 00:12:32,245 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:32,246 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:32,246 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:32,246 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:32,372 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:32,373 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:32,373 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:12:32,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:12:32,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:32,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:12:32,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:32,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:32,585 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:32,586 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:32,586 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:32,587 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:32,587 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:32,587 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:32,635 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:32,814 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:32,846 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:32,852 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:32,852 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:32,853 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:32,854 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:32,854 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:32,855 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:32,855 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:32,856 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:32,860 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:12:32,861 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:12:32,861 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:32,861 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:32,862 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:32,862 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:32,863 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:33,210 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:33,210 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-07 00:12:33,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 00:12:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 00:12:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-07 00:12:33,212 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 25 states. [2019-10-07 00:12:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:33,975 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-10-07 00:12:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 00:12:33,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-07 00:12:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:33,977 INFO L225 Difference]: With dead ends: 49 [2019-10-07 00:12:33,978 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 00:12:33,980 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:12:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 00:12:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-07 00:12:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 00:12:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-07 00:12:33,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-10-07 00:12:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:33,997 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-07 00:12:33,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 00:12:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-07 00:12:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 00:12:33,998 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:33,998 INFO L385 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:34,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:34,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1375752956, now seen corresponding path program 4 times [2019-10-07 00:12:34,201 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:34,201 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:34,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:34,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:34,391 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:34,391 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:34,392 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:12:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:34,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:12:34,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:34,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:34,735 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:34,736 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:34,737 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:34,737 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:34,737 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:34,738 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:34,771 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:34,856 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:34,871 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:34,877 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:34,878 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:34,878 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:34,878 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:34,879 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:34,879 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:34,879 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:34,879 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:34,880 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:12:34,880 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:12:34,880 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:34,880 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:34,880 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:34,881 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:34,881 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:35,252 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:35,252 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-07 00:12:35,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 00:12:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 00:12:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 00:12:35,254 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-07 00:12:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:36,597 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2019-10-07 00:12:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 00:12:36,603 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-07 00:12:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:36,604 INFO L225 Difference]: With dead ends: 63 [2019-10-07 00:12:36,604 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 00:12:36,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-07 00:12:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 00:12:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-10-07 00:12:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-07 00:12:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-07 00:12:36,617 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2019-10-07 00:12:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:36,618 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-07 00:12:36,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 00:12:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-07 00:12:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 00:12:36,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:36,623 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:36,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:36,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -118694588, now seen corresponding path program 5 times [2019-10-07 00:12:36,829 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:36,829 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:36,829 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:36,829 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:12:37,272 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:37,272 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:37,272 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:12:37,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:12:37,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:37,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:12:37,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:12:37,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:12:37,575 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:37,577 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:37,577 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:37,577 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:37,578 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:37,578 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:37,602 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:37,685 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:37,698 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:37,701 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:37,702 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:37,702 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:37,702 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:37,702 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:37,702 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:37,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:37,703 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:37,703 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:12:37,703 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:12:37,706 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:37,706 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:37,707 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:37,707 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:37,707 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:38,141 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:38,142 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-07 00:12:38,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-07 00:12:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-07 00:12:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-07 00:12:38,145 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 49 states. [2019-10-07 00:12:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:40,580 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-10-07 00:12:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 00:12:40,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 42 [2019-10-07 00:12:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:40,588 INFO L225 Difference]: With dead ends: 70 [2019-10-07 00:12:40,588 INFO L226 Difference]: Without dead ends: 56 [2019-10-07 00:12:40,592 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-07 00:12:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-07 00:12:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-07 00:12:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 00:12:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-07 00:12:40,618 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2019-10-07 00:12:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:40,619 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-07 00:12:40,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-07 00:12:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-07 00:12:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 00:12:40,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:40,620 INFO L385 BasicCegarLoop]: trace histogram [27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:40,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:40,821 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:40,822 INFO L82 PathProgramCache]: Analyzing trace with hash 426553522, now seen corresponding path program 6 times [2019-10-07 00:12:40,822 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:40,823 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:40,823 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:40,823 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:41,250 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:41,250 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:41,250 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:12:41,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:12:41,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:12:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:12:41,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:41,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:42,350 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:42,351 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:42,351 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:42,352 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:42,352 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:42,352 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:42,383 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:42,467 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:42,485 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:42,491 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:42,492 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:42,493 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:42,493 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:42,494 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:42,494 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:42,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:42,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:42,495 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:12:42,495 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:12:42,495 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:42,496 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:42,496 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:42,496 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:42,497 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:12:42,881 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:42,882 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-07 00:12:42,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-07 00:12:42,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-07 00:12:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 00:12:42,885 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 69 states. [2019-10-07 00:12:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:12:46,096 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-07 00:12:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-07 00:12:46,097 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 49 [2019-10-07 00:12:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:12:46,099 INFO L225 Difference]: With dead ends: 105 [2019-10-07 00:12:46,099 INFO L226 Difference]: Without dead ends: 85 [2019-10-07 00:12:46,105 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-07 00:12:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-07 00:12:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-10-07 00:12:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-07 00:12:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-07 00:12:46,118 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 49 [2019-10-07 00:12:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:12:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-07 00:12:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-07 00:12:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-07 00:12:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 00:12:46,121 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:12:46,121 INFO L385 BasicCegarLoop]: trace histogram [56, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:12:46,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:12:46,331 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:12:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:12:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1211031940, now seen corresponding path program 7 times [2019-10-07 00:12:46,332 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:12:46,332 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:46,333 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:46,333 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:12:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:12:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:47,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:12:47,644 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:12:47,644 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:12:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:12:47,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:12:47,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:12:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:47,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:12:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:12:51,393 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:12:51,395 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:12:51,395 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:12:51,395 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:12:51,396 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:12:51,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:12:51,417 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:12:51,492 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:12:51,503 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:12:51,506 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:12:51,506 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:12:51,506 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:12:51,506 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:51,507 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:12:51,507 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:51,507 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:12:51,507 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:12:51,508 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:12:51,508 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:12:51,508 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:12:51,508 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:12:51,508 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:12:51,509 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:12:51,509 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:12:52,062 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:12:52,063 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-07 00:12:52,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-07 00:12:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-07 00:12:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-07 00:12:52,070 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 127 states. [2019-10-07 00:13:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:13:01,589 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2019-10-07 00:13:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-07 00:13:01,589 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 78 [2019-10-07 00:13:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:13:01,592 INFO L225 Difference]: With dead ends: 163 [2019-10-07 00:13:01,592 INFO L226 Difference]: Without dead ends: 143 [2019-10-07 00:13:01,597 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-07 00:13:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-07 00:13:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-10-07 00:13:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-07 00:13:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-07 00:13:01,615 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 78 [2019-10-07 00:13:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:13:01,615 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-07 00:13:01,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-07 00:13:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-07 00:13:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-07 00:13:01,618 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:13:01,618 INFO L385 BasicCegarLoop]: trace histogram [114, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:13:01,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:01,823 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:13:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:13:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2051514436, now seen corresponding path program 8 times [2019-10-07 00:13:01,824 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:13:01,824 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:01,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:01,825 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:13:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:13:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:13:06,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:06,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:13:06,980 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 [2019-10-07 00:13:07,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-07 00:13:07,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:13:07,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:13:07,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:13:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:13:07,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:13:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6610 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:13:09,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:13:09,229 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:13:09,229 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:13:09,230 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:13:09,230 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:13:09,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:13:09,254 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:13:09,336 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:13:09,350 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:13:09,353 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:13:09,354 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:13:09,354 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:13:09,354 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:09,354 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:13:09,355 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:13:09,355 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:13:09,355 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:13:09,356 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:13:09,356 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:13:09,356 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:13:09,356 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:13:09,356 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:13:09,356 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:09,357 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:13:10,235 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:13:10,236 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 13, 13, 11] total 149 [2019-10-07 00:13:10,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-10-07 00:13:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-10-07 00:13:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7090, Invalid=14962, Unknown=0, NotChecked=0, Total=22052 [2019-10-07 00:13:10,241 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 149 states. [2019-10-07 00:13:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:13:24,158 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2019-10-07 00:13:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-07 00:13:24,158 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 136 [2019-10-07 00:13:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:13:24,161 INFO L225 Difference]: With dead ends: 176 [2019-10-07 00:13:24,161 INFO L226 Difference]: Without dead ends: 156 [2019-10-07 00:13:24,166 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16068 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=21308, Invalid=64248, Unknown=0, NotChecked=0, Total=85556 [2019-10-07 00:13:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-07 00:13:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2019-10-07 00:13:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-07 00:13:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2019-10-07 00:13:24,183 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 136 [2019-10-07 00:13:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:13:24,184 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2019-10-07 00:13:24,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-10-07 00:13:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2019-10-07 00:13:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:13:24,187 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:13:24,187 INFO L385 BasicCegarLoop]: trace histogram [115, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:13:24,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:24,392 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:13:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:13:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash 906308274, now seen corresponding path program 9 times [2019-10-07 00:13:24,393 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:13:24,393 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:24,393 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:24,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:13:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:13:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:13:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6923 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:13:29,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:13:29,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:13:29,451 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:13:29,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:13:29,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:13:29,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:13:29,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:13:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6923 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:13:29,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:13:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6923 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:13:44,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:13:44,134 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:13:44,135 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:13:44,135 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:13:44,135 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:13:44,135 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:13:44,159 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:13:44,223 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:13:44,231 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:13:44,234 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:13:44,234 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:13:44,235 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:13:44,235 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:44,235 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:13:44,235 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:13:44,235 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:13:44,236 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:13:44,236 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:13:44,236 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:13:44,236 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:13:44,237 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:13:44,237 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:13:44,237 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:13:44,237 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:13:45,078 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:13:45,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-07 00:13:45,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-07 00:13:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-07 00:13:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-07 00:13:45,086 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 245 states. [2019-10-07 00:14:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:19,379 INFO L93 Difference]: Finished difference Result 305 states and 426 transitions. [2019-10-07 00:14:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-07 00:14:19,380 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 149 [2019-10-07 00:14:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:19,382 INFO L225 Difference]: With dead ends: 305 [2019-10-07 00:14:19,382 INFO L226 Difference]: Without dead ends: 273 [2019-10-07 00:14:19,389 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-07 00:14:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-07 00:14:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2019-10-07 00:14:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-07 00:14:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2019-10-07 00:14:19,419 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 149 [2019-10-07 00:14:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:19,419 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2019-10-07 00:14:19,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-07 00:14:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2019-10-07 00:14:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-07 00:14:19,424 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:19,424 INFO L385 BasicCegarLoop]: trace histogram [232, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:19,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:19,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1360263292, now seen corresponding path program 10 times [2019-10-07 00:14:19,632 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:19,632 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:19,632 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:19,632 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27281 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:14:39,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:39,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:39,172 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:39,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:14:39,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27281 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:14:39,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27281 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:15:36,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:36,871 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:36,871 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:36,871 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:36,871 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:36,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:36,893 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:36,975 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:36,989 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:36,992 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:36,992 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:36,992 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:15:36,993 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:36,993 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:15:36,993 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:15:36,993 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:36,993 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:15:36,993 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:15:36,994 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:15:36,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:15:36,994 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:15:36,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:36,994 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:15:36,995 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 00:15:38,378 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:38,379 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-07 00:15:38,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-07 00:15:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-07 00:15:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-07 00:15:38,396 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand 479 states. [2019-10-07 00:15:53,089 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:17:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:17:45,063 INFO L93 Difference]: Finished difference Result 539 states and 777 transitions. [2019-10-07 00:17:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-07 00:17:45,064 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 266 [2019-10-07 00:17:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:17:45,067 INFO L225 Difference]: With dead ends: 539 [2019-10-07 00:17:45,067 INFO L226 Difference]: Without dead ends: 507 [2019-10-07 00:17:45,096 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1505 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 195.2s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-07 00:17:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-07 00:17:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2019-10-07 00:17:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-07 00:17:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 506 transitions. [2019-10-07 00:17:45,125 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 506 transitions. Word has length 266 [2019-10-07 00:17:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:17:45,126 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 506 transitions. [2019-10-07 00:17:45,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-07 00:17:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 506 transitions. [2019-10-07 00:17:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-10-07 00:17:45,138 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:17:45,138 INFO L385 BasicCegarLoop]: trace histogram [466, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:17:45,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:17:45,344 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:17:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:17:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash 772284484, now seen corresponding path program 11 times [2019-10-07 00:17:45,345 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:17:45,345 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:17:45,346 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:17:45,346 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:17:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:17:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:19:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 109064 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-07 00:19:01,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:19:01,850 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:19:01,850 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:19:02,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-07 00:19:02,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:19:02,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:19:02,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:19:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 109064 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:19:07,048 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:19:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 109064 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-07 00:19:11,907 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:19:11,909 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:19:11,909 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:19:11,909 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:19:11,909 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:19:11,910 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:19:11,932 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:19:11,988 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:19:11,996 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:19:11,999 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:19:11,999 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:19:11,999 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 00:19:11,999 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem5|) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:19:11,999 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-07 00:19:11,999 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:19:11,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:19:12,000 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 00:19:12,000 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:19:12,000 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:19:12,000 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:19:12,000 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:19:12,001 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:19:12,001 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:19:12,001 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 00:19:14,658 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:19:14,659 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 25, 25, 11] total 525 [2019-10-07 00:19:14,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 525 states [2019-10-07 00:19:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 525 interpolants. [2019-10-07 00:19:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110902, Invalid=164198, Unknown=0, NotChecked=0, Total=275100 [2019-10-07 00:19:14,680 INFO L87 Difference]: Start difference. First operand 504 states and 506 transitions. Second operand 525 states. [2019-10-07 00:19:16,437 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:19:42,252 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:20:23,370 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:21:32,407 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-07 00:21:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:21:58,503 INFO L93 Difference]: Finished difference Result 564 states and 593 transitions. [2019-10-07 00:21:58,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 525 states. [2019-10-07 00:21:58,503 INFO L78 Accepts]: Start accepts. Automaton has 525 states. Word has length 500 [2019-10-07 00:21:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:21:58,507 INFO L225 Difference]: With dead ends: 564 [2019-10-07 00:21:58,507 INFO L226 Difference]: Without dead ends: 532 [2019-10-07 00:21:58,540 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2488 GetRequests, 1445 SyntacticMatches, 0 SemanticMatches, 1043 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174394 ImplicationChecksByTransitivity, 234.0s TimeCoverageRelationStatistics Valid=332792, Invalid=758188, Unknown=0, NotChecked=0, Total=1090980 [2019-10-07 00:21:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-07 00:21:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 529. [2019-10-07 00:21:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-07 00:21:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 531 transitions. [2019-10-07 00:21:58,569 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 531 transitions. Word has length 500 [2019-10-07 00:21:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:21:58,570 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 531 transitions. [2019-10-07 00:21:58,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 525 states. [2019-10-07 00:21:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 531 transitions. [2019-10-07 00:21:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-10-07 00:21:58,575 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:21:58,575 INFO L385 BasicCegarLoop]: trace histogram [467, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:21:58,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:21:58,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:21:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:21:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1674713934, now seen corresponding path program 12 times [2019-10-07 00:21:58,783 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:21:58,783 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:58,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:58,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:21:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:22:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:22:23,441 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-10-07 00:23:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 110359 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:23:17,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:23:17,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:23:17,144 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:23:17,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:23:17,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:23:17,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 3042 conjuncts, 469 conjunts are in the unsatisfiable core [2019-10-07 00:23:17,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:23:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 110359 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-07 00:23:18,490 INFO L322 TraceCheckSpWp]: Computing backward predicates...