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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:53,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:53,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:53,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:53,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:53,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:53,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:53,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:53,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:53,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:53,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:53,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:53,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:53,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:53,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:53,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:53,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:53,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:53,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:53,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:53,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:53,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:53,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:53,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:53,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:53,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:53,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:53,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:53,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:53,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:53,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:53,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:53,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:53,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:53,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:53,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:53,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:53,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:53,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:53,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:53,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:53,364 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:53,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:53,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:53,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:53,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:53,379 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:53,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:53,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:53,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:53,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:53,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:53,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:53,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:53,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:53,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:53,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:53,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:53,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:53,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:53,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:53,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:53,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:53,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:53,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:53,384 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:53,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:53,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:53,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:53,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:53,694 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:53,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-07 13:28:53,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1571e69/9e7ee4219a274351ba630263309e5b34/FLAG070e6ee53 [2019-10-07 13:28:54,233 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:54,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-07 13:28:54,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1571e69/9e7ee4219a274351ba630263309e5b34/FLAG070e6ee53 [2019-10-07 13:28:54,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1571e69/9e7ee4219a274351ba630263309e5b34 [2019-10-07 13:28:54,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:54,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:54,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:54,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:54,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:54,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:54" (1/1) ... [2019-10-07 13:28:54,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644964f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:54, skipping insertion in model container [2019-10-07 13:28:54,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:54" (1/1) ... [2019-10-07 13:28:54,607 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:54,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:54,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:54,831 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:54,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:54,888 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:54,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:54 WrapperNode [2019-10-07 13:28:54,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:54,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:54,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:54,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:54,985 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:54" (1/1) ... [2019-10-07 13:28:54,985 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:54" (1/1) ... [2019-10-07 13:28:54,991 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:54" (1/1) ... [2019-10-07 13:28:54,992 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:54" (1/1) ... [2019-10-07 13:28:54,997 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:54" (1/1) ... [2019-10-07 13:28:55,004 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:54" (1/1) ... [2019-10-07 13:28:55,005 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:54" (1/1) ... [2019-10-07 13:28:55,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:55,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:55,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:55,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:55,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:54" (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:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:55,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:55,540 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:55,542 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:55,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:55 BoogieIcfgContainer [2019-10-07 13:28:55,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:55,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:55,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:55,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:55,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:54" (1/3) ... [2019-10-07 13:28:55,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46af3198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:55, skipping insertion in model container [2019-10-07 13:28:55,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:54" (2/3) ... [2019-10-07 13:28:55,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46af3198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:55, skipping insertion in model container [2019-10-07 13:28:55,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:55" (3/3) ... [2019-10-07 13:28:55,551 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-07 13:28:55,560 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:55,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:55,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:55,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:55,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:55,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:55,608 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:55,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:55,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:55,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:55,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-07 13:28:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:55,631 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,631 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash -582921348, now seen corresponding path program 1 times [2019-10-07 13:28:55,644 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,644 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,644 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,817 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:55,818 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,819 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,819 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:55,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:55,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,839 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2019-10-07 13:28:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,907 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-07 13:28:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:55,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,923 INFO L225 Difference]: With dead ends: 62 [2019-10-07 13:28:55,924 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:28:55,929 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:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:28:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-10-07 13:28:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2019-10-07 13:28:55,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 10 [2019-10-07 13:28:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,970 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2019-10-07 13:28:55,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2019-10-07 13:28:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:55,971 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,971 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,972 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash -890478900, now seen corresponding path program 1 times [2019-10-07 13:28:55,973 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,973 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,036 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:56,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,038 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,038 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,041 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 4 states. [2019-10-07 13:28:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,066 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2019-10-07 13:28:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,068 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:28:56,068 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:28:56,069 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:56,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:28:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2019-10-07 13:28:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2019-10-07 13:28:56,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 11 [2019-10-07 13:28:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,076 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2019-10-07 13:28:56,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2019-10-07 13:28:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:56,077 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,077 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:56,077 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1834828079, now seen corresponding path program 1 times [2019-10-07 13:28:56,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,138 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:56,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,139 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,139 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,143 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2019-10-07 13:28:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,182 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2019-10-07 13:28:56,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,183 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:56,183 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:56,184 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:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2019-10-07 13:28:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2019-10-07 13:28:56,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 12 [2019-10-07 13:28:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,190 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-10-07 13:28:56,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2019-10-07 13:28:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:56,191 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,191 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:56,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1044881215, now seen corresponding path program 1 times [2019-10-07 13:28:56,193 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,193 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,193 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,193 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,284 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:56,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,285 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,287 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2019-10-07 13:28:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,320 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2019-10-07 13:28:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,323 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:28:56,323 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:28:56,323 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:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:28:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-07 13:28:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-10-07 13:28:56,333 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 13 [2019-10-07 13:28:56,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,333 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-10-07 13:28:56,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-10-07 13:28:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:56,336 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,336 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:56,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1968635430, now seen corresponding path program 1 times [2019-10-07 13:28:56,338 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,338 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,338 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,424 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:56,424 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,424 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,425 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,426 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 4 states. [2019-10-07 13:28:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,446 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2019-10-07 13:28:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,448 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:28:56,448 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:56,449 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:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-10-07 13:28:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-10-07 13:28:56,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 14 [2019-10-07 13:28:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,454 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-10-07 13:28:56,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-10-07 13:28:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:56,455 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,455 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:56,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 898371254, now seen corresponding path program 1 times [2019-10-07 13:28:56,456 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,457 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,457 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,516 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:56,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,516 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,517 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,518 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 4 states. [2019-10-07 13:28:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,542 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2019-10-07 13:28:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:56,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,543 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:56,543 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:28:56,544 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:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:28:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-10-07 13:28:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-10-07 13:28:56,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 15 [2019-10-07 13:28:56,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,548 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-07 13:28:56,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2019-10-07 13:28:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:56,549 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,550 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:56,550 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2079920507, now seen corresponding path program 1 times [2019-10-07 13:28:56,550 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,551 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,551 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,590 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:56,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,591 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,591 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,592 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2019-10-07 13:28:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,621 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-10-07 13:28:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,622 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:28:56,623 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:28:56,623 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:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:28:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-07 13:28:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-10-07 13:28:56,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 16 [2019-10-07 13:28:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,634 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-10-07 13:28:56,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-10-07 13:28:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:56,634 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,635 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:56,635 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash 53242027, now seen corresponding path program 1 times [2019-10-07 13:28:56,636 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,636 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,636 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,636 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,701 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:56,701 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,701 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,702 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,703 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-10-07 13:28:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,719 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-10-07 13:28:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,721 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:28:56,721 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:28:56,721 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:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:28:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-07 13:28:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:28:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-07 13:28:56,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2019-10-07 13:28:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,725 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-07 13:28:56,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-07 13:28:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:28:56,726 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:56,726 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:56,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:56,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1650718928, now seen corresponding path program 1 times [2019-10-07 13:28:56,727 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:56,727 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,727 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,728 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:56,765 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:56,766 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:56,766 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:56,766 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:56,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:56,767 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2019-10-07 13:28:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:56,792 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-10-07 13:28:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:56,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:28:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:56,794 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:28:56,794 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:56,795 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:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:56,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-10-07 13:28:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:56,796 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:56,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:56,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:56,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:56,825 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:56,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:56,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:56,826 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:56,826 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:56,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:56,827 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,827 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-07 13:28:56,827 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-07 13:28:56,828 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-07 13:28:56,828 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,828 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-07 13:28:56,828 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-07 13:28:56,829 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-07 13:28:56,829 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-07 13:28:56,830 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,833 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-07 13:28:56,833 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-07 13:28:56,833 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-07 13:28:56,834 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-07 13:28:56,834 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,834 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,835 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-07 13:28:56,835 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-07 13:28:56,835 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,835 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-07 13:28:56,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:56 BoogieIcfgContainer [2019-10-07 13:28:56,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:56,852 INFO L168 Benchmark]: Toolchain (without parser) took 2257.97 ms. Allocated memory was 145.2 MB in the beginning and 234.4 MB in the end (delta: 89.1 MB). Free memory was 103.3 MB in the beginning and 170.0 MB in the end (delta: -66.7 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:56,854 INFO L168 Benchmark]: CDTParser took 1.13 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 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:56,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.79 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:56,857 INFO L168 Benchmark]: Boogie Preprocessor took 118.37 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 92.7 MB in the beginning and 179.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:56,863 INFO L168 Benchmark]: RCFGBuilder took 535.46 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 148.2 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:56,864 INFO L168 Benchmark]: TraceAbstraction took 1304.11 ms. Allocated memory was 201.3 MB in the beginning and 234.4 MB in the end (delta: 33.0 MB). Free memory was 147.6 MB in the beginning and 170.0 MB in the end (delta: -22.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:56,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.79 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.37 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 92.7 MB in the beginning and 179.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 535.46 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 148.2 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1304.11 ms. Allocated memory was 201.3 MB in the beginning and 234.4 MB in the end (delta: 33.0 MB). Free memory was 147.6 MB in the beginning and 170.0 MB in the end (delta: -22.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 341 SDtfs, 254 SDslu, 475 SDs, 0 SdLazy, 81 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 5685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...