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_copyInit_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:34:13,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:34:13,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:34:13,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:34:13,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:34:13,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:34:13,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:34:13,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:34:13,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:34:13,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:34:13,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:34:13,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:34:13,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:34:13,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:34:13,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:34:13,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:34:13,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:34:13,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:34:13,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:34:13,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:34:13,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:34:13,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:34:13,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:34:13,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:34:13,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:34:13,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:34:13,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:34:13,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:34:13,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:34:13,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:34:13,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:34:13,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:34:13,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:34:13,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:34:13,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:34:13,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:34:13,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:34:13,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:34:13,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:34:13,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:34:13,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:34:13,547 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-13 21:34:13,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:34:13,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:34:13,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:34:13,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:34:13,566 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:34:13,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:34:13,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:34:13,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:34:13,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:34:13,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:34:13,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:34:13,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:34:13,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:34:13,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:34:13,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:34:13,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:34:13,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:34:13,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:34:13,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:34:13,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:34:13,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:34:13,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:34:13,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:34:13,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:34:13,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:34:13,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:34:13,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:34:13,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:34:13,572 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-13 21:34:13,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:34:13,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:34:13,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:34:13,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:34:13,889 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:34:13,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInit_ground.i [2019-10-13 21:34:13,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bed4dd09/108b2438d5f84766b044a2c939ccb7dd/FLAGdeccb9c5c [2019-10-13 21:34:14,364 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:34:14,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInit_ground.i [2019-10-13 21:34:14,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bed4dd09/108b2438d5f84766b044a2c939ccb7dd/FLAGdeccb9c5c [2019-10-13 21:34:14,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bed4dd09/108b2438d5f84766b044a2c939ccb7dd [2019-10-13 21:34:14,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:34:14,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:34:14,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:14,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:34:14,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:34:14,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:14" (1/1) ... [2019-10-13 21:34:14,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2a1825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:14, skipping insertion in model container [2019-10-13 21:34:14,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:34:14" (1/1) ... [2019-10-13 21:34:14,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:34:14,759 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:34:14,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:14,966 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:34:14,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:34:15,002 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:34:15,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15 WrapperNode [2019-10-13 21:34:15,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:34:15,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:34:15,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:34:15,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:34:15,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (1/1) ... [2019-10-13 21:34:15,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:34:15,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:34:15,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:34:15,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:34:15,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (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-13 21:34:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:34:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:34:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:34:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:34:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:34:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:34:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:34:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:34:15,534 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:34:15,535 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:34:15,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:15 BoogieIcfgContainer [2019-10-13 21:34:15,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:34:15,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:34:15,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:34:15,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:34:15,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:34:14" (1/3) ... [2019-10-13 21:34:15,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52daf00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:15, skipping insertion in model container [2019-10-13 21:34:15,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:34:15" (2/3) ... [2019-10-13 21:34:15,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52daf00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:34:15, skipping insertion in model container [2019-10-13 21:34:15,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:34:15" (3/3) ... [2019-10-13 21:34:15,544 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copyInit_ground.i [2019-10-13 21:34:15,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:34:15,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:34:15,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:34:15,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:34:15,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:34:15,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:34:15,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:34:15,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:34:15,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:34:15,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:34:15,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:34:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:34:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:34:15,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:15,624 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:15,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1632961120, now seen corresponding path program 1 times [2019-10-13 21:34:15,642 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:15,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891614857] [2019-10-13 21:34:15,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:15,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:15,802 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-13 21:34:15,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891614857] [2019-10-13 21:34:15,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:34:15,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:34:15,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650289078] [2019-10-13 21:34:15,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:34:15,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:34:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:34:15,827 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:34:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:15,885 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-13 21:34:15,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:34:15,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:34:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:15,902 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:34:15,902 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:34:15,911 INFO L600 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-13 21:34:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:34:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:34:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:34:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:34:15,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-13 21:34:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:34:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:34:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:34:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:34:15,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:15,968 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:15,969 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -924804708, now seen corresponding path program 1 times [2019-10-13 21:34:15,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:15,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362783249] [2019-10-13 21:34:15,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:15,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:15,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:16,094 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-13 21:34:16,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362783249] [2019-10-13 21:34:16,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998258861] [2019-10-13 21:34:16,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:16,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:34:16,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:16,197 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-13 21:34:16,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:16,237 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-13 21:34:16,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293166431] [2019-10-13 21:34:16,269 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:34:16,269 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:16,294 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:16,304 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:16,305 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:16,476 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:17,220 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:34:17,234 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:17,240 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:17,241 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:17,241 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_1) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:17,241 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:17,242 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_1) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:17,242 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:17,242 INFO L193 IcfgInterpreter]: Reachable states at location L7-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:17,243 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem3|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:17,243 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-13 21:34:17,243 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-13 21:34:17,244 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 21:34:17,244 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:17,244 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:17,244 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_1) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:34:17,245 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_1) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:17,795 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:17,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-13 21:34:17,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324025749] [2019-10-13 21:34:17,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:34:17,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:34:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:34:17,799 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:34:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:18,562 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-13 21:34:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:34:18,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:34:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:18,565 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:34:18,565 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:34:18,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:34:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:34:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-10-13 21:34:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:34:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:34:18,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:34:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:18,600 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:34:18,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:34:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:34:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:34:18,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:18,603 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:18,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:18,817 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1819409760, now seen corresponding path program 2 times [2019-10-13 21:34:18,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:18,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005631028] [2019-10-13 21:34:18,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:18,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:18,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:18,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005631028] [2019-10-13 21:34:18,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934898317] [2019-10-13 21:34:18,928 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:34:18,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:34:18,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:18,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:34:18,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:19,018 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:34:19,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144427372] [2019-10-13 21:34:19,087 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:34:19,087 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:19,088 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:19,088 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:19,088 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:19,130 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:19,633 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:34:19,649 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:19,663 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:19,663 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:19,664 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_2) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:19,664 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:19,664 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_2) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:19,664 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:19,665 INFO L193 IcfgInterpreter]: Reachable states at location L7-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:19,665 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem3|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:19,665 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-13 21:34:19,665 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-13 21:34:19,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 21:34:19,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:19,666 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:19,667 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_2) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:34:19,667 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_2) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:20,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:20,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 23 [2019-10-13 21:34:20,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168348449] [2019-10-13 21:34:20,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:34:20,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:34:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:34:20,146 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2019-10-13 21:34:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:21,325 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-13 21:34:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:34:21,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-13 21:34:21,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:21,328 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:34:21,328 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 21:34:21,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:34:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 21:34:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2019-10-13 21:34:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:34:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-13 21:34:21,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2019-10-13 21:34:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:21,349 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-13 21:34:21,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:34:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-13 21:34:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:34:21,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:21,351 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:21,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:21,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 708262432, now seen corresponding path program 3 times [2019-10-13 21:34:21,556 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:21,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363026567] [2019-10-13 21:34:21,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:21,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:34:21,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363026567] [2019-10-13 21:34:21,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985588069] [2019-10-13 21:34:21,689 INFO L92 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-13 21:34:21,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:21,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:21,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:34:21,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:34:21,785 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:34:22,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [149319325] [2019-10-13 21:34:22,016 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:34:22,016 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:22,017 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:22,017 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:22,017 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:22,059 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:22,391 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:34:22,404 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:22,416 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:22,416 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:22,416 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((v_prenex_3 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_3) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,417 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_3 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_3) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,417 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:22,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:22,417 INFO L193 IcfgInterpreter]: Reachable states at location L7-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:22,418 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem3|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:22,418 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-13 21:34:22,423 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-13 21:34:22,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 21:34:22,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:22,424 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:22,424 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_3 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_3) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,425 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_prenex_3 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 42 (select (select |#memory_int| v_prenex_3) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:34:23,120 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:23,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 10] total 35 [2019-10-13 21:34:23,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846264115] [2019-10-13 21:34:23,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:34:23,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:34:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:34:23,123 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 35 states. [2019-10-13 21:34:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:25,102 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2019-10-13 21:34:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:34:25,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2019-10-13 21:34:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:25,110 INFO L225 Difference]: With dead ends: 89 [2019-10-13 21:34:25,110 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:34:25,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:34:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:34:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-13 21:34:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:34:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 21:34:25,126 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-10-13 21:34:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:25,127 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 21:34:25,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:34:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 21:34:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:34:25,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:25,129 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:25,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:25,341 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:25,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1847424736, now seen corresponding path program 4 times [2019-10-13 21:34:25,341 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:25,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435517829] [2019-10-13 21:34:25,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:25,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:25,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:34:25,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435517829] [2019-10-13 21:34:25,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654495066] [2019-10-13 21:34:25,753 INFO L92 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-13 21:34:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:25,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:34:25,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:34:25,867 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:34:26,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [892418888] [2019-10-13 21:34:26,513 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:34:26,513 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:26,513 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:26,513 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:26,514 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:26,538 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:26,836 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:34:26,842 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:26,847 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:26,847 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:26,847 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 129#(and (exists ((v_prenex_4 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 42 (select (select |#memory_int| v_prenex_4) 0))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,848 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 42 (select (select |#memory_int| v_prenex_4) 0))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,848 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 114#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:26,848 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:26,848 INFO L193 IcfgInterpreter]: Reachable states at location L7-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= (store (store |old(#length)| |main_~#a~0.base| 400000) |main_~#b~0.base| 400000) |#length|) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |main_~#b~0.offset| 0) (= |#valid| (store (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base| 1)) (not (= |main_~#b~0.base| 0)) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (= |main_~#b~0.offset| 0) (= |main_~#a~0.offset| 0) (< |main_~#b~0.base| |#StackHeapBarrier|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= (select (store |old(#valid)| |main_~#a~0.base| 1) |main_~#b~0.base|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |main_~#b~0.offset|) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:26,848 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 119#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~x~0 4) |main_~#b~0.offset|)) |main_#t~mem3|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 0 |main_~#b~0.offset|) (= main_~x~0 0) (= |main_~#b~0.offset| 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:26,848 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-13 21:34:26,849 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-13 21:34:26,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 21:34:26,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:26,849 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 109#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |main_~#b~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#b~0.offset|) (= |main_~#b~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-13 21:34:26,849 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 42 (select (select |#memory_int| v_prenex_4) 0))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:26,849 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((v_prenex_4 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 42 (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 42 (select (select |#memory_int| v_prenex_4) 0))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:34:28,131 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:28,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 10] total 59 [2019-10-13 21:34:28,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752343574] [2019-10-13 21:34:28,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-13 21:34:28,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-13 21:34:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:34:28,138 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 59 states. [2019-10-13 21:34:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:32,483 INFO L93 Difference]: Finished difference Result 149 states and 200 transitions. [2019-10-13 21:34:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-13 21:34:32,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2019-10-13 21:34:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:32,485 INFO L225 Difference]: With dead ends: 149 [2019-10-13 21:34:32,486 INFO L226 Difference]: Without dead ends: 117 [2019-10-13 21:34:32,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 113 SyntacticMatches, 23 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3606, Invalid=8826, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 21:34:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-13 21:34:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-13 21:34:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 21:34:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-13 21:34:32,506 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 56 [2019-10-13 21:34:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:32,507 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-13 21:34:32,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-13 21:34:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-13 21:34:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:34:32,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:32,509 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:32,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:32,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1342396640, now seen corresponding path program 5 times [2019-10-13 21:34:32,716 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:32,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309814768] [2019-10-13 21:34:32,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:32,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:32,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:34:33,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309814768] [2019-10-13 21:34:33,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584256995] [2019-10-13 21:34:33,787 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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