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-crafted/zero_sum5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:36,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:36,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:36,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:36,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:36,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:36,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:36,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:36,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:36,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:36,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:36,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:36,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:36,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:36,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:36,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:36,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:36,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:36,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:36,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:36,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:36,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:36,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:36,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:36,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:36,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:36,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:36,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:36,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:36,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:36,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:36,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:36,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:36,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:36,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:36,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:36,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:36,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:36,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:36,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:36,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:36,808 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-15 01:30:36,843 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:36,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:36,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:36,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:36,845 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:36,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:36,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:36,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:36,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:36,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:36,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:36,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:36,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:36,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:36,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:36,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:36,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:36,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:36,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:36,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:36,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:36,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:36,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:36,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:36,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:36,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:36,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:36,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:36,855 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-15 01:30:37,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:37,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:37,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:37,226 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:37,227 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:37,227 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-10-15 01:30:37,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd40b4e8e/22be4763e83b4511aca178fbb65cdc56/FLAGeb86e8de3 [2019-10-15 01:30:37,780 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:30:37,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum5.c [2019-10-15 01:30:37,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd40b4e8e/22be4763e83b4511aca178fbb65cdc56/FLAGeb86e8de3 [2019-10-15 01:30:38,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd40b4e8e/22be4763e83b4511aca178fbb65cdc56 [2019-10-15 01:30:38,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:30:38,163 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:30:38,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:38,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:30:38,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:30:38,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38, skipping insertion in model container [2019-10-15 01:30:38,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,179 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:30:38,200 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:30:38,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:38,409 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:30:38,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:38,551 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:30:38,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38 WrapperNode [2019-10-15 01:30:38,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:38,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:30:38,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:30:38,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:30:38,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (1/1) ... [2019-10-15 01:30:38,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:30:38,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:30:38,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:30:38,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:30:38,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (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-15 01:30:38,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:30:38,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:30:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:30:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:30:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:30:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:30:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:30:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-15 01:30:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:30:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:30:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:30:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:30:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:30:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:30:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:30:39,282 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:30:39,282 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-10-15 01:30:39,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:39 BoogieIcfgContainer [2019-10-15 01:30:39,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:30:39,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:30:39,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:30:39,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:30:39,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:30:38" (1/3) ... [2019-10-15 01:30:39,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a21a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:39, skipping insertion in model container [2019-10-15 01:30:39,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:38" (2/3) ... [2019-10-15 01:30:39,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a21a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:39, skipping insertion in model container [2019-10-15 01:30:39,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:39" (3/3) ... [2019-10-15 01:30:39,296 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum5.c [2019-10-15 01:30:39,307 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:30:39,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:30:39,329 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:30:39,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:30:39,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:30:39,360 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:30:39,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:30:39,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:30:39,361 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:30:39,361 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:30:39,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:30:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-15 01:30:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:30:39,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:39,392 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] [2019-10-15 01:30:39,393 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash -205990741, now seen corresponding path program 1 times [2019-10-15 01:30:39,408 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:39,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203543382] [2019-10-15 01:30:39,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:39,639 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-15 01:30:39,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203543382] [2019-10-15 01:30:39,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:39,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:30:39,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012853718] [2019-10-15 01:30:39,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:30:39,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:39,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:30:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:30:39,665 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-10-15 01:30:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:39,835 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-10-15 01:30:39,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:30:39,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-15 01:30:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:39,851 INFO L225 Difference]: With dead ends: 56 [2019-10-15 01:30:39,851 INFO L226 Difference]: Without dead ends: 32 [2019-10-15 01:30:39,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:30:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-15 01:30:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-15 01:30:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-15 01:30:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2019-10-15 01:30:39,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 21 [2019-10-15 01:30:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:39,910 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 51 transitions. [2019-10-15 01:30:39,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:30:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2019-10-15 01:30:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:30:39,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:39,912 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] [2019-10-15 01:30:39,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 940905143, now seen corresponding path program 1 times [2019-10-15 01:30:39,913 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:39,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829530054] [2019-10-15 01:30:39,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:40,019 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-15 01:30:40,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829530054] [2019-10-15 01:30:40,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:40,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:30:40,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677176476] [2019-10-15 01:30:40,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:30:40,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:30:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:40,023 INFO L87 Difference]: Start difference. First operand 32 states and 51 transitions. Second operand 3 states. [2019-10-15 01:30:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:40,092 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-10-15 01:30:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:30:40,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:30:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:40,094 INFO L225 Difference]: With dead ends: 58 [2019-10-15 01:30:40,094 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 01:30:40,095 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-15 01:30:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 01:30:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-15 01:30:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 01:30:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-10-15 01:30:40,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 22 [2019-10-15 01:30:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:40,105 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-10-15 01:30:40,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:30:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-10-15 01:30:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:30:40,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:40,106 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] [2019-10-15 01:30:40,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1041186174, now seen corresponding path program 1 times [2019-10-15 01:30:40,108 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:40,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348589906] [2019-10-15 01:30:40,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:40,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:40,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:40,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348589906] [2019-10-15 01:30:40,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:40,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:30:40,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343137644] [2019-10-15 01:30:40,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:30:40,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:30:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:40,176 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-10-15 01:30:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:40,313 INFO L93 Difference]: Finished difference Result 56 states and 92 transitions. [2019-10-15 01:30:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:30:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-15 01:30:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:40,315 INFO L225 Difference]: With dead ends: 56 [2019-10-15 01:30:40,315 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 01:30:40,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 01:30:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-15 01:30:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 01:30:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-15 01:30:40,323 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2019-10-15 01:30:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:40,324 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-15 01:30:40,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:30:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-10-15 01:30:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:30:40,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:40,325 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, 1, 1, 1, 1] [2019-10-15 01:30:40,325 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:40,326 INFO L82 PathProgramCache]: Analyzing trace with hash 608840992, now seen corresponding path program 1 times [2019-10-15 01:30:40,326 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:40,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771006920] [2019-10-15 01:30:40,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:40,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:40,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:40,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771006920] [2019-10-15 01:30:40,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833729261] [2019-10-15 01:30:40,417 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-15 01:30:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:40,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:40,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:40,547 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:40,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [741219464] [2019-10-15 01:30:40,647 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:40,648 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:40,656 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:40,666 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:40,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:40,925 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:41,536 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:41,577 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:41,585 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:41,965 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:41,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:30:41,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776779588] [2019-10-15 01:30:41,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 01:30:41,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 01:30:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:30:41,968 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 17 states. [2019-10-15 01:30:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:42,395 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-10-15 01:30:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:30:42,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-10-15 01:30:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:42,398 INFO L225 Difference]: With dead ends: 59 [2019-10-15 01:30:42,398 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 01:30:42,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:30:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 01:30:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-15 01:30:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 01:30:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-10-15 01:30:42,410 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 32 [2019-10-15 01:30:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:42,412 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-15 01:30:42,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 01:30:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-10-15 01:30:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:30:42,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:42,414 INFO L380 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2019-10-15 01:30:42,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:42,619 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1126249689, now seen corresponding path program 2 times [2019-10-15 01:30:42,620 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:42,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017618746] [2019-10-15 01:30:42,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:42,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:42,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:42,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017618746] [2019-10-15 01:30:42,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292363649] [2019-10-15 01:30:42,755 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-15 01:30:42,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:30:42,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:42,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:42,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:42,893 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:42,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338461011] [2019-10-15 01:30:42,921 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:42,921 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:42,922 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:42,922 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:42,922 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:42,960 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:43,326 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:43,340 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:43,346 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:43,692 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:43,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-15 01:30:43,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476280741] [2019-10-15 01:30:43,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:30:43,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:30:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:30:43,695 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 18 states. [2019-10-15 01:30:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:44,100 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2019-10-15 01:30:44,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:30:44,101 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-10-15 01:30:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:44,101 INFO L225 Difference]: With dead ends: 67 [2019-10-15 01:30:44,102 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:30:44,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:30:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:30:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-15 01:30:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 01:30:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-15 01:30:44,112 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 33 [2019-10-15 01:30:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:44,112 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-15 01:30:44,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:30:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-15 01:30:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:30:44,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:44,114 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1] [2019-10-15 01:30:44,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:44,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1666989621, now seen corresponding path program 3 times [2019-10-15 01:30:44,316 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:44,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247136872] [2019-10-15 01:30:44,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:44,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:44,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:45,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247136872] [2019-10-15 01:30:45,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348431370] [2019-10-15 01:30:45,301 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-15 01:30:45,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:45,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:45,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-15 01:30:45,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:45,698 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:46,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826009806] [2019-10-15 01:30:46,018 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:46,018 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:46,019 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:46,019 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:46,019 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:46,043 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:46,343 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:46,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:46,356 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:46,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:46,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 11] total 33 [2019-10-15 01:30:46,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90703634] [2019-10-15 01:30:46,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 01:30:46,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 01:30:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:30:46,863 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 33 states. [2019-10-15 01:30:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:48,153 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-10-15 01:30:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:30:48,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-10-15 01:30:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:48,156 INFO L225 Difference]: With dead ends: 77 [2019-10-15 01:30:48,156 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 01:30:48,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 102 SyntacticMatches, 32 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2019-10-15 01:30:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 01:30:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-15 01:30:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-15 01:30:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-10-15 01:30:48,168 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 43 [2019-10-15 01:30:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:48,168 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-10-15 01:30:48,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 01:30:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2019-10-15 01:30:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:30:48,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:48,170 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1] [2019-10-15 01:30:48,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:48,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -893816937, now seen corresponding path program 4 times [2019-10-15 01:30:48,372 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:48,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112902260] [2019-10-15 01:30:48,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:30:48,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112902260] [2019-10-15 01:30:48,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312552527] [2019-10-15 01:30:48,427 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-15 01:30:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:48,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:30:48,615 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:30:48,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544503653] [2019-10-15 01:30:48,653 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:48,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:48,654 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:48,654 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:48,654 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:48,678 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:49,011 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:49,022 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:49,026 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:49,394 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:49,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 23 [2019-10-15 01:30:49,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189291925] [2019-10-15 01:30:49,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-15 01:30:49,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-15 01:30:49,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:30:49,396 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 23 states. [2019-10-15 01:30:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:50,056 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2019-10-15 01:30:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:30:50,056 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-10-15 01:30:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:50,058 INFO L225 Difference]: With dead ends: 134 [2019-10-15 01:30:50,058 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 01:30:50,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:30:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 01:30:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-15 01:30:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-15 01:30:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-10-15 01:30:50,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 44 [2019-10-15 01:30:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:50,070 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-10-15 01:30:50,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-15 01:30:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-10-15 01:30:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:30:50,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:50,072 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1] [2019-10-15 01:30:50,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:50,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1998177506, now seen corresponding path program 5 times [2019-10-15 01:30:50,279 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:50,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702398536] [2019-10-15 01:30:50,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:50,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:50,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:30:50,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702398536] [2019-10-15 01:30:50,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042592175] [2019-10-15 01:30:50,363 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-15 01:30:50,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:50,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:50,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:30:50,589 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:30:50,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [854406211] [2019-10-15 01:30:50,676 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:50,676 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:50,677 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:50,677 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:50,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:50,695 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:50,934 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:50,966 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:50,969 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:51,318 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:51,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-15 01:30:51,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447130294] [2019-10-15 01:30:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:30:51,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:30:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:51,321 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 26 states. [2019-10-15 01:30:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:52,116 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2019-10-15 01:30:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:30:52,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-10-15 01:30:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:52,119 INFO L225 Difference]: With dead ends: 110 [2019-10-15 01:30:52,119 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 01:30:52,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2019-10-15 01:30:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 01:30:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-15 01:30:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 01:30:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-10-15 01:30:52,130 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 45 [2019-10-15 01:30:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:52,131 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-10-15 01:30:52,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:30:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-10-15 01:30:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:30:52,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:52,132 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:52,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:52,337 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1338189056, now seen corresponding path program 6 times [2019-10-15 01:30:52,338 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:52,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895847179] [2019-10-15 01:30:52,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:52,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:52,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:53,073 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2019-10-15 01:30:53,185 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 14 [2019-10-15 01:30:53,368 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2019-10-15 01:30:53,587 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-10-15 01:30:53,755 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2019-10-15 01:30:53,973 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2019-10-15 01:30:54,198 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-10-15 01:30:54,369 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 26 [2019-10-15 01:30:54,534 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 17 [2019-10-15 01:30:54,707 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 25 [2019-10-15 01:30:54,915 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-10-15 01:30:55,140 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-10-15 01:30:55,335 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2019-10-15 01:30:55,958 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-10-15 01:30:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:56,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895847179] [2019-10-15 01:30:56,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455556865] [2019-10-15 01:30:56,484 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-15 01:30:56,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:56,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:56,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 130 conjunts are in the unsatisfiable core [2019-10-15 01:30:56,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:57,339 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:57,941 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 29 [2019-10-15 01:30:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:58,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1582598446] [2019-10-15 01:30:58,015 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:30:58,016 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:58,016 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:58,016 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:58,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:58,044 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:58,322 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:58,335 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:58,340 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:59,136 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:59,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13, 11] total 53 [2019-10-15 01:30:59,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730818114] [2019-10-15 01:30:59,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-15 01:30:59,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-15 01:30:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2561, Unknown=0, NotChecked=0, Total=2756 [2019-10-15 01:30:59,140 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 53 states. [2019-10-15 01:31:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:02,333 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2019-10-15 01:31:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-15 01:31:02,333 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-10-15 01:31:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:02,336 INFO L225 Difference]: With dead ends: 142 [2019-10-15 01:31:02,336 INFO L226 Difference]: Without dead ends: 97 [2019-10-15 01:31:02,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 118 SyntacticMatches, 41 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=412, Invalid=5138, Unknown=0, NotChecked=0, Total=5550 [2019-10-15 01:31:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-15 01:31:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-10-15 01:31:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-15 01:31:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-10-15 01:31:02,352 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 54 [2019-10-15 01:31:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:02,353 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-10-15 01:31:02,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-15 01:31:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2019-10-15 01:31:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:31:02,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:02,355 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:02,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:02,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -470187952, now seen corresponding path program 7 times [2019-10-15 01:31:02,561 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:02,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938016071] [2019-10-15 01:31:02,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:31:02,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938016071] [2019-10-15 01:31:02,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361097764] [2019-10-15 01:31:02,637 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-15 01:31:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:02,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:31:02,951 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:31:03,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1198362212] [2019-10-15 01:31:03,032 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:31:03,033 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:03,033 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:03,033 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:03,033 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:03,055 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:31:03,283 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:31:03,293 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:31:03,296 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:03,708 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:03,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11] total 30 [2019-10-15 01:31:03,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052666550] [2019-10-15 01:31:03,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 01:31:03,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 01:31:03,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:31:03,712 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 30 states. [2019-10-15 01:31:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:04,967 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2019-10-15 01:31:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-15 01:31:04,967 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-10-15 01:31:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:04,970 INFO L225 Difference]: With dead ends: 218 [2019-10-15 01:31:04,970 INFO L226 Difference]: Without dead ends: 104 [2019-10-15 01:31:04,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2019-10-15 01:31:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-15 01:31:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2019-10-15 01:31:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-15 01:31:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2019-10-15 01:31:04,991 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 55 [2019-10-15 01:31:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:04,991 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2019-10-15 01:31:04,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-15 01:31:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2019-10-15 01:31:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:31:04,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:04,993 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:05,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:05,198 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1761891923, now seen corresponding path program 8 times [2019-10-15 01:31:05,199 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:05,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290075697] [2019-10-15 01:31:05,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:05,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:05,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-15 01:31:05,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290075697] [2019-10-15 01:31:05,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293498403] [2019-10-15 01:31:05,298 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:05,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:31:05,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:05,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:05,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-15 01:31:05,536 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-15 01:31:05,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [532393227] [2019-10-15 01:31:05,624 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 01:31:05,625 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:05,625 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:05,625 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:05,625 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:05,645 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:31:05,854 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:31:05,862 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:31:05,864 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:06,195 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:06,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-15 01:31:06,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275021629] [2019-10-15 01:31:06,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:31:06,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:31:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:31:06,198 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 27 states. [2019-10-15 01:31:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:06,917 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-10-15 01:31:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 01:31:06,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-10-15 01:31:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:06,919 INFO L225 Difference]: With dead ends: 103 [2019-10-15 01:31:06,919 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:31:06,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 145 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 01:31:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:31:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-15 01:31:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-15 01:31:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-10-15 01:31:06,929 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 56 [2019-10-15 01:31:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:06,929 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-10-15 01:31:06,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:31:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-10-15 01:31:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:31:06,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:06,931 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:07,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:07,136 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1734428395, now seen corresponding path program 9 times [2019-10-15 01:31:07,137 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:07,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723791157] [2019-10-15 01:31:07,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:07,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:07,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:08,105 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 11 [2019-10-15 01:31:08,249 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2019-10-15 01:31:08,522 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 35 [2019-10-15 01:31:08,820 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 36 [2019-10-15 01:31:09,107 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 37 [2019-10-15 01:31:09,378 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 34 [2019-10-15 01:31:09,654 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2019-10-15 01:31:09,935 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 36 [2019-10-15 01:31:10,200 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 31 [2019-10-15 01:31:10,431 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 25 [2019-10-15 01:31:10,632 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 18 [2019-10-15 01:31:10,818 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 17 [2019-10-15 01:31:11,340 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 40 [2019-10-15 01:31:11,589 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2019-10-15 01:31:11,803 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2019-10-15 01:31:11,994 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 22 [2019-10-15 01:31:12,370 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 35 [2019-10-15 01:31:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:13,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723791157] [2019-10-15 01:31:13,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680207365] [2019-10-15 01:31:13,216 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:13,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:31:13,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:13,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 170 conjunts are in the unsatisfiable core [2019-10-15 01:31:13,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:14,437 INFO L321 TraceCheckSpWp]: Computing backward predicates...