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/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:34,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:34,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:34,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:34,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:34,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:34,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:34,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:34,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:34,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:34,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:34,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:34,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:34,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:34,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:34,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:34,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:34,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:34,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:34,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:34,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:34,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:34,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:34,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:34,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:34,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:34,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:34,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:34,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:34,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:34,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:34,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:34,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:34,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:34,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:34,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:34,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:34,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:34,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:34,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:34,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:34,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:28:34,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:34,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:34,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:34,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:34,638 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:34,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:34,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:34,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:34,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:34,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:34,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:34,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:34,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:34,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:34,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:34,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:34,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:34,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:34,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:34,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:34,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:34,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:34,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:34,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:34,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:34,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:34,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:34,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:34,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:34,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:34,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:34,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:34,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:34,952 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:34,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-07 13:28:35,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c90fbe1f/2e443d5121f74548bf18c43c96519cb6/FLAG98ee59dd9 [2019-10-07 13:28:35,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:35,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-07 13:28:35,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c90fbe1f/2e443d5121f74548bf18c43c96519cb6/FLAG98ee59dd9 [2019-10-07 13:28:35,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c90fbe1f/2e443d5121f74548bf18c43c96519cb6 [2019-10-07 13:28:35,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:35,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:35,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:35,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:35,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:35,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:35" (1/1) ... [2019-10-07 13:28:35,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:35, skipping insertion in model container [2019-10-07 13:28:35,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:35" (1/1) ... [2019-10-07 13:28:35,905 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:35,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:36,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:36,164 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:36,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:36,301 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:36,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36 WrapperNode [2019-10-07 13:28:36,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:36,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:36,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:36,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:36,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... [2019-10-07 13:28:36,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:36,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:36,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:36,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:36,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:36,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:36,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:36,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:37,059 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:37,060 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:37,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:37 BoogieIcfgContainer [2019-10-07 13:28:37,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:37,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:37,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:37,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:37,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:35" (1/3) ... [2019-10-07 13:28:37,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d565b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:37, skipping insertion in model container [2019-10-07 13:28:37,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:36" (2/3) ... [2019-10-07 13:28:37,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d565b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:37, skipping insertion in model container [2019-10-07 13:28:37,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:37" (3/3) ... [2019-10-07 13:28:37,071 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-10-07 13:28:37,081 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:37,090 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:37,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:37,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:37,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:37,137 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:37,137 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:37,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:37,138 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:37,139 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:37,139 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-07 13:28:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:37,166 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:37,168 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:37,172 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash 134551869, now seen corresponding path program 1 times [2019-10-07 13:28:37,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:37,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:37,386 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,387 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:37,388 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:37,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:37,410 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-10-07 13:28:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:37,471 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2019-10-07 13:28:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:37,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:37,486 INFO L225 Difference]: With dead ends: 82 [2019-10-07 13:28:37,486 INFO L226 Difference]: Without dead ends: 67 [2019-10-07 13:28:37,490 INFO L606 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-07 13:28:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-07 13:28:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-10-07 13:28:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-10-07 13:28:37,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 10 [2019-10-07 13:28:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:37,533 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-10-07 13:28:37,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-10-07 13:28:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:37,534 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:37,535 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:37,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -123647273, now seen corresponding path program 1 times [2019-10-07 13:28:37,536 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:37,536 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,536 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,537 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:37,606 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,606 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:37,606 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:37,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:37,609 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 4 states. [2019-10-07 13:28:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:37,638 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2019-10-07 13:28:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:37,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:37,641 INFO L225 Difference]: With dead ends: 67 [2019-10-07 13:28:37,641 INFO L226 Difference]: Without dead ends: 65 [2019-10-07 13:28:37,642 INFO L606 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-07 13:28:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-07 13:28:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2019-10-07 13:28:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2019-10-07 13:28:37,650 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 11 [2019-10-07 13:28:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:37,651 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2019-10-07 13:28:37,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2019-10-07 13:28:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:37,652 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:37,653 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:37,653 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 462114258, now seen corresponding path program 1 times [2019-10-07 13:28:37,654 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:37,654 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,654 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:37,784 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,785 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:37,785 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:37,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:37,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:37,789 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand 4 states. [2019-10-07 13:28:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:37,835 INFO L93 Difference]: Finished difference Result 65 states and 110 transitions. [2019-10-07 13:28:37,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:37,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:37,840 INFO L225 Difference]: With dead ends: 65 [2019-10-07 13:28:37,840 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 13:28:37,841 INFO L606 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-07 13:28:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 13:28:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-10-07 13:28:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2019-10-07 13:28:37,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 12 [2019-10-07 13:28:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:37,861 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2019-10-07 13:28:37,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2019-10-07 13:28:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:37,865 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:37,865 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:37,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1440852876, now seen corresponding path program 1 times [2019-10-07 13:28:37,867 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:37,867 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,868 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,868 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:37,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:37,971 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:37,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:37,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:37,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:37,975 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 4 states. [2019-10-07 13:28:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:37,999 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2019-10-07 13:28:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,001 INFO L225 Difference]: With dead ends: 63 [2019-10-07 13:28:38,001 INFO L226 Difference]: Without dead ends: 61 [2019-10-07 13:28:38,001 INFO L606 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-07 13:28:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-07 13:28:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2019-10-07 13:28:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2019-10-07 13:28:38,007 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 13 [2019-10-07 13:28:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,008 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 60 transitions. [2019-10-07 13:28:38,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2019-10-07 13:28:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:38,009 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,009 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1716979303, now seen corresponding path program 1 times [2019-10-07 13:28:38,010 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,010 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,010 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,010 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,070 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,070 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,071 INFO L87 Difference]: Start difference. First operand 37 states and 60 transitions. Second operand 4 states. [2019-10-07 13:28:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,102 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions. [2019-10-07 13:28:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,106 INFO L225 Difference]: With dead ends: 61 [2019-10-07 13:28:38,106 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 13:28:38,107 INFO L606 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-07 13:28:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 13:28:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-10-07 13:28:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2019-10-07 13:28:38,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 14 [2019-10-07 13:28:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,113 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2019-10-07 13:28:38,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2019-10-07 13:28:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:38,114 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,114 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,115 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1686964289, now seen corresponding path program 1 times [2019-10-07 13:28:38,115 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,116 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,116 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,116 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,160 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,162 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 4 states. [2019-10-07 13:28:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,188 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-10-07 13:28:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,191 INFO L225 Difference]: With dead ends: 59 [2019-10-07 13:28:38,191 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:28:38,191 INFO L606 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-07 13:28:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:28:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-10-07 13:28:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2019-10-07 13:28:38,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 15 [2019-10-07 13:28:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,198 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2019-10-07 13:28:38,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2019-10-07 13:28:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:38,200 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,200 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 756499196, now seen corresponding path program 1 times [2019-10-07 13:28:38,202 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,206 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,284 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,289 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand 4 states. [2019-10-07 13:28:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,323 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-07 13:28:38,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,326 INFO L225 Difference]: With dead ends: 57 [2019-10-07 13:28:38,326 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 13:28:38,326 INFO L606 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-07 13:28:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 13:28:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-10-07 13:28:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2019-10-07 13:28:38,336 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 16 [2019-10-07 13:28:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2019-10-07 13:28:38,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2019-10-07 13:28:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:38,340 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,340 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1976852726, now seen corresponding path program 1 times [2019-10-07 13:28:38,341 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,342 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,342 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,342 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,407 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,408 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,408 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,410 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 4 states. [2019-10-07 13:28:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,432 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2019-10-07 13:28:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,434 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:28:38,435 INFO L226 Difference]: Without dead ends: 53 [2019-10-07 13:28:38,435 INFO L606 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-07 13:28:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-07 13:28:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2019-10-07 13:28:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2019-10-07 13:28:38,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 17 [2019-10-07 13:28:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,441 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2019-10-07 13:28:38,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2019-10-07 13:28:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:28:38,442 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,442 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1153106833, now seen corresponding path program 1 times [2019-10-07 13:28:38,446 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,446 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,446 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,447 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,480 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,480 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,480 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,481 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2019-10-07 13:28:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,504 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2019-10-07 13:28:38,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:28:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,506 INFO L225 Difference]: With dead ends: 53 [2019-10-07 13:28:38,506 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 13:28:38,507 INFO L606 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-07 13:28:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 13:28:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2019-10-07 13:28:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-10-07 13:28:38,510 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 18 [2019-10-07 13:28:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,511 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-10-07 13:28:38,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-10-07 13:28:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:28:38,512 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,512 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1386788267, now seen corresponding path program 1 times [2019-10-07 13:28:38,513 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,513 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,513 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,513 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,547 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,547 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,548 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 4 states. [2019-10-07 13:28:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,572 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2019-10-07 13:28:38,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-07 13:28:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,573 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:28:38,573 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 13:28:38,574 INFO L606 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-07 13:28:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 13:28:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-10-07 13:28:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2019-10-07 13:28:38,578 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2019-10-07 13:28:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,578 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-10-07 13:28:38,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2019-10-07 13:28:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:28:38,579 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,579 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:38,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 40978470, now seen corresponding path program 1 times [2019-10-07 13:28:38,580 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,580 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,612 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,613 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,614 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 4 states. [2019-10-07 13:28:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,631 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2019-10-07 13:28:38,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 13:28:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,633 INFO L225 Difference]: With dead ends: 49 [2019-10-07 13:28:38,633 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:28:38,634 INFO L606 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-07 13:28:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:28:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2019-10-07 13:28:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2019-10-07 13:28:38,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 20 [2019-10-07 13:28:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,637 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2019-10-07 13:28:38,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2019-10-07 13:28:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:28:38,638 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,638 INFO L385 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-07 13:28:38,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1270548064, now seen corresponding path program 1 times [2019-10-07 13:28:38,639 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,639 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,639 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,671 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,672 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,672 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,673 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 4 states. [2019-10-07 13:28:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,690 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2019-10-07 13:28:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-07 13:28:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,692 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:28:38,692 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:28:38,692 INFO L606 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-07 13:28:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:28:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-07 13:28:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-10-07 13:28:38,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 21 [2019-10-07 13:28:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,696 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-10-07 13:28:38,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-10-07 13:28:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:28:38,697 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,697 INFO L385 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-07 13:28:38,697 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 732500155, now seen corresponding path program 1 times [2019-10-07 13:28:38,698 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,698 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,698 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,741 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,741 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,741 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,744 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 4 states. [2019-10-07 13:28:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,761 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-07 13:28:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-07 13:28:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,763 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:38,763 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:38,764 INFO L606 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-07 13:28:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-10-07 13:28:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 13:28:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-10-07 13:28:38,767 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-10-07 13:28:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,767 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-10-07 13:28:38,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-10-07 13:28:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 13:28:38,769 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:38,769 INFO L385 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-07 13:28:38,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1232884501, now seen corresponding path program 1 times [2019-10-07 13:28:38,770 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:38,770 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,770 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:38,803 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:38,803 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:38,803 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:38,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:38,804 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 4 states. [2019-10-07 13:28:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:38,821 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-07 13:28:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:38,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-07 13:28:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:38,822 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:38,822 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:38,823 INFO L606 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-07 13:28:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:38,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-07 13:28:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:38,825 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:38,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:38,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:38,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:38,850 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:38,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:38,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:38,851 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:38,851 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:38,851 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:38,851 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2019-10-07 13:28:38,852 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-10-07 13:28:38,853 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,853 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,853 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,854 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-10-07 13:28:38,854 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-07 13:28:38,854 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,855 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-07 13:28:38,855 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,855 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-07 13:28:38,855 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,855 INFO L446 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-10-07 13:28:38,855 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-07 13:28:38,856 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-10-07 13:28:38,857 INFO L439 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-10-07 13:28:38,857 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,857 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,857 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-07 13:28:38,857 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-10-07 13:28:38,857 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-10-07 13:28:38,858 INFO L446 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,858 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-10-07 13:28:38,859 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-07 13:28:38,859 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-07 13:28:38,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:38 BoogieIcfgContainer [2019-10-07 13:28:38,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:38,876 INFO L168 Benchmark]: Toolchain (without parser) took 2985.37 ms. Allocated memory was 144.2 MB in the beginning and 233.8 MB in the end (delta: 89.7 MB). Free memory was 102.6 MB in the beginning and 94.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,878 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.48 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 181.0 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,887 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,888 INFO L168 Benchmark]: RCFGBuilder took 715.98 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 133.3 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,889 INFO L168 Benchmark]: TraceAbstraction took 1808.32 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 132.6 MB in the beginning and 94.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:38,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 413.48 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 181.0 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 715.98 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 133.3 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1808.32 ms. Allocated memory was 201.9 MB in the beginning and 233.8 MB in the end (delta: 32.0 MB). Free memory was 132.6 MB in the beginning and 94.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 771 SDtfs, 604 SDslu, 1141 SDs, 0 SdLazy, 132 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 234 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 15155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...