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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:35,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:35,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:35,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:35,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:35,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:35,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:35,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:35,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:35,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:35,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:35,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:35,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:35,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:35,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:35,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:35,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:35,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:35,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:35,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:35,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:35,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:35,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:35,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:35,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:35,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:35,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:35,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:35,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:35,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:35,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:35,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:35,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:35,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:35,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:35,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:35,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:35,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:35,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:35,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:35,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:35,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:00:35,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:35,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:35,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:35,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:35,852 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:35,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:35,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:35,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:35,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:35,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:35,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:35,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:35,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:35,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:35,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:35,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:35,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:35,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:35,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:35,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:35,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:35,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:35,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:35,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:35,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:35,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:35,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:35,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:35,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:00:36,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:36,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:36,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:36,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:36,158 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:36,158 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-15 03:00:36,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958030a4b/d7e00a4b74d04f6a8bd5ef785c0d7e41/FLAGae15aa6ae [2019-10-15 03:00:36,700 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:36,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-15 03:00:36,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958030a4b/d7e00a4b74d04f6a8bd5ef785c0d7e41/FLAGae15aa6ae [2019-10-15 03:00:37,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958030a4b/d7e00a4b74d04f6a8bd5ef785c0d7e41 [2019-10-15 03:00:37,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:37,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:37,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:37,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:37,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:37,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c0bab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37, skipping insertion in model container [2019-10-15 03:00:37,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:37,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:37,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:37,360 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:37,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:37,477 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:37,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37 WrapperNode [2019-10-15 03:00:37,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:37,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:37,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:37,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:37,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... [2019-10-15 03:00:37,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:37,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:37,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:37,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:37,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:37,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:38,175 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:38,175 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:38,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:38 BoogieIcfgContainer [2019-10-15 03:00:38,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:38,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:38,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:38,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:38,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:37" (1/3) ... [2019-10-15 03:00:38,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:38, skipping insertion in model container [2019-10-15 03:00:38,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:37" (2/3) ... [2019-10-15 03:00:38,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c2b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:38, skipping insertion in model container [2019-10-15 03:00:38,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:38" (3/3) ... [2019-10-15 03:00:38,200 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-15 03:00:38,213 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:38,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:38,237 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:38,271 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:38,271 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:38,271 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:38,272 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:38,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:38,273 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:38,273 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:38,273 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-10-15 03:00:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:38,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:38,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:38,310 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:38,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2137553673, now seen corresponding path program 1 times [2019-10-15 03:00:38,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:38,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431811167] [2019-10-15 03:00:38,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:38,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431811167] [2019-10-15 03:00:38,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:38,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:38,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240652049] [2019-10-15 03:00:38,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:38,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,529 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2019-10-15 03:00:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:38,589 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2019-10-15 03:00:38,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:38,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:38,603 INFO L225 Difference]: With dead ends: 66 [2019-10-15 03:00:38,604 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:38,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2019-10-15 03:00:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2019-10-15 03:00:38,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 10 [2019-10-15 03:00:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:38,647 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2019-10-15 03:00:38,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2019-10-15 03:00:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:38,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:38,649 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:38,649 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1839867803, now seen corresponding path program 1 times [2019-10-15 03:00:38,650 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:38,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106409770] [2019-10-15 03:00:38,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:38,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106409770] [2019-10-15 03:00:38,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:38,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:38,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137780598] [2019-10-15 03:00:38,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:38,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:38,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,743 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand 4 states. [2019-10-15 03:00:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:38,776 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2019-10-15 03:00:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:38,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:38,778 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:38,778 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:38,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2019-10-15 03:00:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2019-10-15 03:00:38,787 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 11 [2019-10-15 03:00:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:38,788 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2019-10-15 03:00:38,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2019-10-15 03:00:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:38,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:38,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:38,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1201540766, now seen corresponding path program 1 times [2019-10-15 03:00:38,791 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:38,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173652495] [2019-10-15 03:00:38,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:38,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173652495] [2019-10-15 03:00:38,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:38,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:38,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497232907] [2019-10-15 03:00:38,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:38,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:38,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,875 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 4 states. [2019-10-15 03:00:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:38,918 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2019-10-15 03:00:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:38,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:38,922 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:38,922 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:38,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2019-10-15 03:00:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-10-15 03:00:38,932 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 12 [2019-10-15 03:00:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:38,933 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-10-15 03:00:38,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-10-15 03:00:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:38,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:38,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:38,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1406727856, now seen corresponding path program 1 times [2019-10-15 03:00:38,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:38,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542822046] [2019-10-15 03:00:38,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:38,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:38,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542822046] [2019-10-15 03:00:38,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:38,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:38,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814848194] [2019-10-15 03:00:38,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:38,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:38,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:38,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:38,988 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2019-10-15 03:00:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,012 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2019-10-15 03:00:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,014 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:39,014 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:39,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-10-15 03:00:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-10-15 03:00:39,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 13 [2019-10-15 03:00:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,021 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-10-15 03:00:39,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2019-10-15 03:00:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:39,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash -658676173, now seen corresponding path program 1 times [2019-10-15 03:00:39,023 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676755698] [2019-10-15 03:00:39,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676755698] [2019-10-15 03:00:39,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352030999] [2019-10-15 03:00:39,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,102 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 4 states. [2019-10-15 03:00:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,125 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-10-15 03:00:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,127 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:39,127 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:39,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-10-15 03:00:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-10-15 03:00:39,133 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 14 [2019-10-15 03:00:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,133 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-10-15 03:00:39,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-10-15 03:00:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:39,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,135 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1056089861, now seen corresponding path program 1 times [2019-10-15 03:00:39,135 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814435328] [2019-10-15 03:00:39,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814435328] [2019-10-15 03:00:39,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422661934] [2019-10-15 03:00:39,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,179 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 4 states. [2019-10-15 03:00:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,204 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2019-10-15 03:00:39,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,207 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:39,207 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:39,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-15 03:00:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-10-15 03:00:39,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 15 [2019-10-15 03:00:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,215 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-10-15 03:00:39,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2019-10-15 03:00:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:39,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737592, now seen corresponding path program 1 times [2019-10-15 03:00:39,217 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027086502] [2019-10-15 03:00:39,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027086502] [2019-10-15 03:00:39,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152732102] [2019-10-15 03:00:39,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,275 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 4 states. [2019-10-15 03:00:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,305 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-10-15 03:00:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:39,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,307 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:39,307 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:00:39,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:00:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-10-15 03:00:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-10-15 03:00:39,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 16 [2019-10-15 03:00:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,314 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-10-15 03:00:39,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2019-10-15 03:00:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:39,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,316 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,316 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1296957626, now seen corresponding path program 1 times [2019-10-15 03:00:39,317 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652997366] [2019-10-15 03:00:39,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652997366] [2019-10-15 03:00:39,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960053512] [2019-10-15 03:00:39,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,399 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-10-15 03:00:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,424 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-15 03:00:39,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,426 INFO L225 Difference]: With dead ends: 39 [2019-10-15 03:00:39,426 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 03:00:39,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 03:00:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-10-15 03:00:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-15 03:00:39,434 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2019-10-15 03:00:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,435 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-15 03:00:39,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-15 03:00:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:39,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,436 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1551196509, now seen corresponding path program 1 times [2019-10-15 03:00:39,437 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260677934] [2019-10-15 03:00:39,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260677934] [2019-10-15 03:00:39,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739502002] [2019-10-15 03:00:39,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,509 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-10-15 03:00:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,530 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-15 03:00:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,531 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:00:39,531 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 03:00:39,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 03:00:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-15 03:00:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:00:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-10-15 03:00:39,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 18 [2019-10-15 03:00:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,536 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-10-15 03:00:39,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-10-15 03:00:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:39,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:39,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:39,537 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash 842667631, now seen corresponding path program 1 times [2019-10-15 03:00:39,538 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:39,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842423] [2019-10-15 03:00:39,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:39,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:39,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842423] [2019-10-15 03:00:39,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:39,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:39,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717449495] [2019-10-15 03:00:39,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:39,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:39,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,582 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2019-10-15 03:00:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:39,598 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-10-15 03:00:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:39,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:39,599 INFO L225 Difference]: With dead ends: 31 [2019-10-15 03:00:39,599 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:39,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:39,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-15 03:00:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:39,601 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:39,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:39,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:39,621 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:39,622 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:39,622 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:39,622 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:39,622 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:39,622 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:39,622 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-15 03:00:39,622 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-15 03:00:39,622 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,623 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-15 03:00:39,623 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,624 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-15 03:00:39,625 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-15 03:00:39,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:39 BoogieIcfgContainer [2019-10-15 03:00:39,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:39,634 INFO L168 Benchmark]: Toolchain (without parser) took 2529.72 ms. Allocated memory was 138.4 MB in the beginning and 235.9 MB in the end (delta: 97.5 MB). Free memory was 102.0 MB in the beginning and 155.5 MB in the end (delta: -53.4 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,634 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.26 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 181.6 MB in the end (delta: -79.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,636 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 202.4 MB. Free memory was 181.6 MB in the beginning and 179.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,637 INFO L168 Benchmark]: RCFGBuilder took 661.94 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 144.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,638 INFO L168 Benchmark]: TraceAbstraction took 1448.62 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 143.7 MB in the beginning and 155.5 MB in the end (delta: -11.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:39,642 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.30 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.26 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 181.6 MB in the end (delta: -79.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 202.4 MB. Free memory was 181.6 MB in the beginning and 179.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 661.94 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 144.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1448.62 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 143.7 MB in the beginning and 155.5 MB in the end (delta: -11.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 413 SDtfs, 312 SDslu, 592 SDs, 0 SdLazy, 94 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 10 MinimizatonAttempts, 126 StatesRemovedByMinimization, 9 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, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 7125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...