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_copy8_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:48,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:48,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:48,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:48,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:48,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:48,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:48,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:48,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:48,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:48,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:48,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:48,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:48,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:48,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:48,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:48,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:49,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:49,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:49,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:49,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:49,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:49,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:49,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:49,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:49,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:49,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:49,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:49,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:49,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:49,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:49,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:49,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:49,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:49,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:49,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:49,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:49,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:49,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:49,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:49,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:49,034 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:33:49,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:49,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:49,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:49,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:49,060 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:49,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:49,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:49,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:49,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:49,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:49,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:49,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:49,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:49,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:49,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:49,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:49,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:49,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:49,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:49,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:49,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:49,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:49,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:49,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:49,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:49,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:49,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:49,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:49,066 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:33:49,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:49,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:49,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:49,434 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:49,434 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:49,435 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-13 21:33:49,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a6c18f7/de6d7d51299d4dd3a111472e837a0156/FLAG55b341170 [2019-10-13 21:33:49,971 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:49,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-13 21:33:49,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a6c18f7/de6d7d51299d4dd3a111472e837a0156/FLAG55b341170 [2019-10-13 21:33:50,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a6c18f7/de6d7d51299d4dd3a111472e837a0156 [2019-10-13 21:33:50,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:50,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:50,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:50,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:50,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:50,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2e6592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50, skipping insertion in model container [2019-10-13 21:33:50,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:50,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:50,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:50,568 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:50,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:50,722 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:50,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50 WrapperNode [2019-10-13 21:33:50,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:50,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:50,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:50,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:50,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (1/1) ... [2019-10-13 21:33:50,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:50,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:50,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:50,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:50,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (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:33:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:51,441 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:51,442 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:33:51,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:51 BoogieIcfgContainer [2019-10-13 21:33:51,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:51,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:51,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:51,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:51,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:50" (1/3) ... [2019-10-13 21:33:51,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78604b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:51, skipping insertion in model container [2019-10-13 21:33:51,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:50" (2/3) ... [2019-10-13 21:33:51,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78604b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:51, skipping insertion in model container [2019-10-13 21:33:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:51" (3/3) ... [2019-10-13 21:33:51,458 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-2.i [2019-10-13 21:33:51,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:51,482 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:51,495 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:51,533 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:51,534 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:51,534 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:51,534 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:51,535 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:51,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:51,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:51,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-13 21:33:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:33:51,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:51,565 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:51,567 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1040189996, now seen corresponding path program 1 times [2019-10-13 21:33:51,585 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:51,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617731893] [2019-10-13 21:33:51,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:51,784 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:33:51,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617731893] [2019-10-13 21:33:51,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:51,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:51,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39649067] [2019-10-13 21:33:51,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:51,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:51,811 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-10-13 21:33:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:51,854 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-10-13 21:33:51,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:51,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 21:33:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:51,865 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:33:51,865 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:33:51,869 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:33:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:33:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:33:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:33:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-13 21:33:51,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 19 [2019-10-13 21:33:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:51,915 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-13 21:33:51,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-13 21:33:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:33:51,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:51,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:51,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:51,917 INFO L82 PathProgramCache]: Analyzing trace with hash -537190458, now seen corresponding path program 1 times [2019-10-13 21:33:51,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:51,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325194750] [2019-10-13 21:33:51,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:51,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:52,034 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-13 21:33:52,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325194750] [2019-10-13 21:33:52,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:52,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:52,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086420731] [2019-10-13 21:33:52,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:52,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:52,043 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-10-13 21:33:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:52,113 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2019-10-13 21:33:52,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:52,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:33:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:52,115 INFO L225 Difference]: With dead ends: 48 [2019-10-13 21:33:52,115 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:33:52,116 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:33:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:33:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-13 21:33:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:33:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-10-13 21:33:52,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2019-10-13 21:33:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:52,125 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-10-13 21:33:52,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2019-10-13 21:33:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:33:52,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:52,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:52,127 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -669181734, now seen corresponding path program 1 times [2019-10-13 21:33:52,128 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:52,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17729278] [2019-10-13 21:33:52,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:52,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:52,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17729278] [2019-10-13 21:33:52,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040993660] [2019-10-13 21:33:52,277 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:33:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:52,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:52,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:52,440 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:33:52,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [484474045] [2019-10-13 21:33:52,513 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:33:52,513 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:52,520 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:52,531 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:52,531 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:52,669 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:53,262 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:53,577 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:55,159 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:55,172 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:55,180 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:55,180 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:55,181 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:55,181 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:55,181 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:33:55,182 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:55,182 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,183 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,183 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:55,183 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,183 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:55,184 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:33:55,184 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:33:55,184 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:33:55,184 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,185 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,185 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:55,185 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,185 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:33:55,185 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,186 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:55,186 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:55,630 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:55,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:55,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100191324] [2019-10-13 21:33:55,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:55,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:55,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:55,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:55,636 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 18 states. [2019-10-13 21:33:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:56,457 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2019-10-13 21:33:56,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:56,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-10-13 21:33:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:56,459 INFO L225 Difference]: With dead ends: 77 [2019-10-13 21:33:56,459 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:33:56,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:33:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-13 21:33:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:33:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-13 21:33:56,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2019-10-13 21:33:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:56,471 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-13 21:33:56,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-13 21:33:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:33:56,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:56,472 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:56,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:56,676 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash 619647852, now seen corresponding path program 2 times [2019-10-13 21:33:56,678 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:56,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245160535] [2019-10-13 21:33:56,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:56,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:56,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:33:56,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245160535] [2019-10-13 21:33:56,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345673082] [2019-10-13 21:33:56,823 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:33:56,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:56,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:56,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:56,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:56,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:56,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617896382] [2019-10-13 21:33:56,991 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:33:56,991 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:56,992 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:56,992 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:56,992 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:57,021 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:57,956 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:58,801 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:58,814 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:58,818 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:58,818 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:58,818 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,818 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,819 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:33:58,819 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:58,819 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,819 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,819 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,820 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,820 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:58,820 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:33:58,820 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:33:58,820 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:33:58,820 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,821 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,821 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:58,821 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,821 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:58,821 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:58,822 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:58,822 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:59,118 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:59,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:59,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367955515] [2019-10-13 21:33:59,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:59,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:59,122 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 23 states. [2019-10-13 21:34:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:00,295 INFO L93 Difference]: Finished difference Result 118 states and 168 transitions. [2019-10-13 21:34:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:34:00,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-10-13 21:34:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:00,296 INFO L225 Difference]: With dead ends: 118 [2019-10-13 21:34:00,297 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 21:34:00,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:34:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 21:34:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-10-13 21:34:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 21:34:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-13 21:34:00,312 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 39 [2019-10-13 21:34:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:00,312 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-13 21:34:00,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:34:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-13 21:34:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 21:34:00,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:00,315 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:00,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:00,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1999730054, now seen corresponding path program 3 times [2019-10-13 21:34:00,521 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:00,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078277699] [2019-10-13 21:34:00,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:00,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:00,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:00,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078277699] [2019-10-13 21:34:00,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591943826] [2019-10-13 21:34:00,668 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:00,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:00,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:00,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:34:00,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:00,870 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:00,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1746015760] [2019-10-13 21:34:00,940 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:00,940 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:00,940 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:00,940 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:00,940 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:00,961 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:01,793 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:02,625 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:02,632 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:02,635 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:02,636 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:02,636 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,636 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,636 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:34:02,636 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:02,637 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,637 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,637 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:02,637 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,637 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:02,638 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:02,638 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:02,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:02,638 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,638 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,639 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:02,639 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,639 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|))))) [2019-10-13 21:34:02,639 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,639 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:02,640 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:02,906 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:02,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:34:02,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334884204] [2019-10-13 21:34:02,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:34:02,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:34:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:34:02,909 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 25 states. [2019-10-13 21:34:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:03,825 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2019-10-13 21:34:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:34:03,825 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-10-13 21:34:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:03,827 INFO L225 Difference]: With dead ends: 157 [2019-10-13 21:34:03,828 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 21:34:03,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:34:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 21:34:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2019-10-13 21:34:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 21:34:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-10-13 21:34:03,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 72 [2019-10-13 21:34:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:03,843 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-10-13 21:34:03,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:34:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-10-13 21:34:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 21:34:03,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:03,845 INFO L380 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:04,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:04,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1170703852, now seen corresponding path program 4 times [2019-10-13 21:34:04,059 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:04,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732469288] [2019-10-13 21:34:04,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:04,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:04,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:04,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732469288] [2019-10-13 21:34:04,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977307588] [2019-10-13 21:34:04,314 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:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:04,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:34:04,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:04,503 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:04,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921042837] [2019-10-13 21:34:04,773 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:04,774 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:04,774 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:04,774 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:04,774 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:04,798 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:06,008 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:34:06,433 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:06,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:06,445 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:06,446 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:06,446 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:06,446 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:06,446 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:34:06,447 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:06,447 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,447 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,447 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:06,448 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,448 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:06,448 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:06,449 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:06,449 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:06,449 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,449 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,449 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:06,450 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,450 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:34:06,450 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,450 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:06,450 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:06,745 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:06,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:34:06,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99169617] [2019-10-13 21:34:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:34:06,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:06,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:34:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:34:06,749 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 39 states. [2019-10-13 21:34:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:08,180 INFO L93 Difference]: Finished difference Result 171 states and 202 transitions. [2019-10-13 21:34:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:34:08,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2019-10-13 21:34:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:08,182 INFO L225 Difference]: With dead ends: 171 [2019-10-13 21:34:08,182 INFO L226 Difference]: Without dead ends: 106 [2019-10-13 21:34:08,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:34:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-13 21:34:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-10-13 21:34:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-13 21:34:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-10-13 21:34:08,199 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 79 [2019-10-13 21:34:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:08,200 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-10-13 21:34:08,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:34:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-10-13 21:34:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:34:08,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:08,202 INFO L380 BasicCegarLoop]: trace histogram [26, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:08,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:08,406 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:08,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1927430996, now seen corresponding path program 5 times [2019-10-13 21:34:08,407 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:08,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343201711] [2019-10-13 21:34:08,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:08,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:08,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 21:34:08,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343201711] [2019-10-13 21:34:08,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772995268] [2019-10-13 21:34:08,976 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 [2019-10-13 21:34:12,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:34:12,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:12,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:34:12,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2019-10-13 21:34:12,531 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2019-10-13 21:34:12,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1151032716] [2019-10-13 21:34:12,683 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:12,683 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:12,684 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:12,684 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:12,684 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:12,706 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:13,575 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:14,430 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:14,440 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:14,449 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:14,449 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:14,449 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,449 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,450 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:34:14,450 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:14,450 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,450 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,450 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:14,451 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,451 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:14,451 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:14,451 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-13 21:34:14,451 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:14,452 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,452 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,452 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:14,452 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,452 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:34:14,452 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,453 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:14,453 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:14,954 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:14,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-13 21:34:14,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025159066] [2019-10-13 21:34:14,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 21:34:14,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 21:34:14,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:34:14,959 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 53 states. [2019-10-13 21:34:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:18,683 INFO L93 Difference]: Finished difference Result 236 states and 318 transitions. [2019-10-13 21:34:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 21:34:18,684 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 93 [2019-10-13 21:34:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:18,686 INFO L225 Difference]: With dead ends: 236 [2019-10-13 21:34:18,686 INFO L226 Difference]: Without dead ends: 171 [2019-10-13 21:34:18,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 21:34:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-13 21:34:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2019-10-13 21:34:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-13 21:34:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2019-10-13 21:34:18,709 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 93 [2019-10-13 21:34:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:18,710 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2019-10-13 21:34:18,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 21:34:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2019-10-13 21:34:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:34:18,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:18,713 INFO L380 BasicCegarLoop]: trace histogram [27, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:18,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:18,915 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1606878406, now seen corresponding path program 6 times [2019-10-13 21:34:18,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:18,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331320001] [2019-10-13 21:34:18,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:18,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:18,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:19,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331320001] [2019-10-13 21:34:19,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956417995] [2019-10-13 21:34:19,487 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 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-13 21:34:19,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:34:19,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:34:19,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:34:19,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:19,819 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:20,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [136621554] [2019-10-13 21:34:20,712 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:34:20,712 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:20,713 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:20,713 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:20,713 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:20,727 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:21,101 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:21,357 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:21,573 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:34:22,506 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:22,512 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:22,515 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:22,515 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:22,515 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,516 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* main_~x~0 4) |main_~#a9~0.offset|))) (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:22,517 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,517 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:22,517 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,517 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,517 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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,518 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:22,518 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,518 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) [2019-10-13 21:34:22,519 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,519 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:22,519 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:22,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:22,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:34:22,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234662583] [2019-10-13 21:34:22,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:34:22,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:34:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:34:22,907 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 69 states. [2019-10-13 21:34:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:26,207 INFO L93 Difference]: Finished difference Result 329 states and 375 transitions. [2019-10-13 21:34:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-13 21:34:26,207 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 158 [2019-10-13 21:34:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:26,209 INFO L225 Difference]: With dead ends: 329 [2019-10-13 21:34:26,210 INFO L226 Difference]: Without dead ends: 200 [2019-10-13 21:34:26,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-13 21:34:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-13 21:34:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2019-10-13 21:34:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-13 21:34:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 200 transitions. [2019-10-13 21:34:26,236 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 200 transitions. Word has length 158 [2019-10-13 21:34:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:26,236 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 200 transitions. [2019-10-13 21:34:26,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:34:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 200 transitions. [2019-10-13 21:34:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-13 21:34:26,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:26,240 INFO L380 BasicCegarLoop]: trace histogram [56, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:26,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:26,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 199264364, now seen corresponding path program 7 times [2019-10-13 21:34:26,447 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:26,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446189600] [2019-10-13 21:34:26,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:26,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:27,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446189600] [2019-10-13 21:34:27,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944822332] [2019-10-13 21:34:27,893 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 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-13 21:34:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:28,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:34:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:34:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-13 21:34:28,243 INFO L321 TraceCheckSpWp]: Computing backward predicates...