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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:41,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:41,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:41,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:41,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:41,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:41,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:41,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:41,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:41,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:41,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:41,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:41,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:41,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:41,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:41,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:41,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:41,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:41,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:41,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:41,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:41,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:41,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:41,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:41,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:41,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:41,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:41,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:41,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:41,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:41,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:41,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:41,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:41,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:41,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:41,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:41,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:41,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:41,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:41,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:41,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:41,980 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:42,001 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:42,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:42,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:42,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:42,006 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:42,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:42,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:42,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:42,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:42,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:42,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:42,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:42,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:42,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:42,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:42,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:42,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:42,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:42,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:42,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:42,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:42,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:42,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:42,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:42,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:42,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:42,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:42,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:42,015 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:42,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:42,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:42,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:42,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:42,351 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:42,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-10-15 03:00:42,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e40f8d/d3abf87b2ca547dcad73994709383788/FLAGa1b7f0f4a [2019-10-15 03:00:42,886 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:42,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-10-15 03:00:42,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e40f8d/d3abf87b2ca547dcad73994709383788/FLAGa1b7f0f4a [2019-10-15 03:00:43,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e40f8d/d3abf87b2ca547dcad73994709383788 [2019-10-15 03:00:43,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:43,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:43,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:43,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:43,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:43,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:43" (1/1) ... [2019-10-15 03:00:43,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9af163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:43, skipping insertion in model container [2019-10-15 03:00:43,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:43" (1/1) ... [2019-10-15 03:00:43,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:43,286 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:43,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:43,476 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:43,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:43,597 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:43,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:43 WrapperNode [2019-10-15 03:00:43,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:43,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:43,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:43,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:43,609 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:43" (1/1) ... [2019-10-15 03:00:43,609 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:43" (1/1) ... [2019-10-15 03:00:43,615 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:43" (1/1) ... [2019-10-15 03:00:43,615 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:43" (1/1) ... [2019-10-15 03:00:43,622 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:43" (1/1) ... [2019-10-15 03:00:43,630 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:43" (1/1) ... [2019-10-15 03:00:43,632 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:43" (1/1) ... [2019-10-15 03:00:43,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:43,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:43,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:43,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:43,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:43" (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:43,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:43,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:43,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:43,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:43,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:44,317 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:44,317 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:44 BoogieIcfgContainer [2019-10-15 03:00:44,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:44,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:44,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:44,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:44,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:43" (1/3) ... [2019-10-15 03:00:44,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:44, skipping insertion in model container [2019-10-15 03:00:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:43" (2/3) ... [2019-10-15 03:00:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:44, skipping insertion in model container [2019-10-15 03:00:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:44" (3/3) ... [2019-10-15 03:00:44,343 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-15 03:00:44,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:44,366 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:44,378 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:44,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:44,412 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:44,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:44,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:44,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:44,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:44,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:44,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-15 03:00:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:44,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:44,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:44,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1011430877, now seen corresponding path program 1 times [2019-10-15 03:00:44,455 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:44,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756352750] [2019-10-15 03:00:44,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:44,658 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:44,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756352750] [2019-10-15 03:00:44,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:44,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:44,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472841556] [2019-10-15 03:00:44,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:44,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:44,686 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2019-10-15 03:00:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:44,752 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2019-10-15 03:00:44,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:44,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:44,767 INFO L225 Difference]: With dead ends: 74 [2019-10-15 03:00:44,767 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:00:44,771 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:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:00:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-10-15 03:00:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2019-10-15 03:00:44,821 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10 [2019-10-15 03:00:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:44,823 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2019-10-15 03:00:44,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2019-10-15 03:00:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:44,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:44,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:44,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1289373383, now seen corresponding path program 1 times [2019-10-15 03:00:44,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:44,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810714818] [2019-10-15 03:00:44,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:44,911 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:44,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810714818] [2019-10-15 03:00:44,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:44,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:44,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009102943] [2019-10-15 03:00:44,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:44,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:44,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:44,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:44,918 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 4 states. [2019-10-15 03:00:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:44,957 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2019-10-15 03:00:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:44,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:44,959 INFO L225 Difference]: With dead ends: 59 [2019-10-15 03:00:44,959 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 03:00:44,960 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:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 03:00:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2019-10-15 03:00:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2019-10-15 03:00:44,967 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11 [2019-10-15 03:00:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:44,968 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2019-10-15 03:00:44,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2019-10-15 03:00:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:44,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:44,969 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:44,969 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1315656136, now seen corresponding path program 1 times [2019-10-15 03:00:44,970 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:44,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933584757] [2019-10-15 03:00:44,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,039 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:45,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933584757] [2019-10-15 03:00:45,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438315944] [2019-10-15 03:00:45,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,042 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 4 states. [2019-10-15 03:00:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,072 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2019-10-15 03:00:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,074 INFO L225 Difference]: With dead ends: 57 [2019-10-15 03:00:45,075 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:00:45,075 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:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:00:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-10-15 03:00:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2019-10-15 03:00:45,082 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12 [2019-10-15 03:00:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,082 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2019-10-15 03:00:45,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2019-10-15 03:00:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:45,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:45,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2130421138, now seen corresponding path program 1 times [2019-10-15 03:00:45,086 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677515203] [2019-10-15 03:00:45,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,190 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:45,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677515203] [2019-10-15 03:00:45,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671946205] [2019-10-15 03:00:45,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,196 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states. [2019-10-15 03:00:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,223 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2019-10-15 03:00:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,225 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:00:45,225 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:00:45,225 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:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:00:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2019-10-15 03:00:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-10-15 03:00:45,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2019-10-15 03:00:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,231 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-10-15 03:00:45,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-10-15 03:00:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:45,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,232 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:45,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332083, now seen corresponding path program 1 times [2019-10-15 03:00:45,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033669511] [2019-10-15 03:00:45,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,281 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:45,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033669511] [2019-10-15 03:00:45,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38206570] [2019-10-15 03:00:45,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,285 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-10-15 03:00:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,319 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-10-15 03:00:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,321 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:00:45,321 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:45,322 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:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-10-15 03:00:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2019-10-15 03:00:45,335 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14 [2019-10-15 03:00:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,335 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2019-10-15 03:00:45,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2019-10-15 03:00:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:45,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,338 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:45,339 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1371527075, now seen corresponding path program 1 times [2019-10-15 03:00:45,340 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859956938] [2019-10-15 03:00:45,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,412 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:45,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859956938] [2019-10-15 03:00:45,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983701274] [2019-10-15 03:00:45,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,416 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 4 states. [2019-10-15 03:00:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,449 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-10-15 03:00:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,452 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:45,452 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:45,452 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:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-10-15 03:00:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-10-15 03:00:45,460 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15 [2019-10-15 03:00:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,460 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-10-15 03:00:45,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2019-10-15 03:00:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:45,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,465 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:45,466 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -432119198, now seen corresponding path program 1 times [2019-10-15 03:00:45,466 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480150378] [2019-10-15 03:00:45,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,544 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:45,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480150378] [2019-10-15 03:00:45,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403385135] [2019-10-15 03:00:45,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,547 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2019-10-15 03:00:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,569 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2019-10-15 03:00:45,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,570 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:45,570 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:45,571 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:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-10-15 03:00:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-10-15 03:00:45,575 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16 [2019-10-15 03:00:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,575 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-10-15 03:00:45,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-10-15 03:00:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:45,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,576 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:45,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash -510578472, now seen corresponding path program 1 times [2019-10-15 03:00:45,577 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804721201] [2019-10-15 03:00:45,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,630 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:45,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804721201] [2019-10-15 03:00:45,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309241344] [2019-10-15 03:00:45,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,633 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 4 states. [2019-10-15 03:00:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,654 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2019-10-15 03:00:45,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,657 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:45,657 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:45,658 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:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-10-15 03:00:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-10-15 03:00:45,664 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-10-15 03:00:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,669 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-10-15 03:00:45,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-10-15 03:00:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:45,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,671 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:45,671 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1352151671, now seen corresponding path program 1 times [2019-10-15 03:00:45,672 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402557455] [2019-10-15 03:00:45,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,746 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:45,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402557455] [2019-10-15 03:00:45,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522188722] [2019-10-15 03:00:45,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,749 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2019-10-15 03:00:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,772 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-10-15 03:00:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,773 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:45,774 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:45,774 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:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-10-15 03:00:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-10-15 03:00:45,778 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2019-10-15 03:00:45,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,778 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-10-15 03:00:45,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-10-15 03:00:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:45,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,783 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:45,783 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1032755699, now seen corresponding path program 1 times [2019-10-15 03:00:45,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016160251] [2019-10-15 03:00:45,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,844 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:45,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016160251] [2019-10-15 03:00:45,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725999857] [2019-10-15 03:00:45,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,848 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 4 states. [2019-10-15 03:00:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,876 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2019-10-15 03:00:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,877 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:45,879 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:45,880 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:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-10-15 03:00:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2019-10-15 03:00:45,884 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 19 [2019-10-15 03:00:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,884 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-10-15 03:00:45,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2019-10-15 03:00:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:00:45,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:45,888 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1950439796, now seen corresponding path program 1 times [2019-10-15 03:00:45,888 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755640946] [2019-10-15 03:00:45,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,927 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:45,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755640946] [2019-10-15 03:00:45,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857688488] [2019-10-15 03:00:45,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,930 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states. [2019-10-15 03:00:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:45,947 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-10-15 03:00:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:45,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:00:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:45,948 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:45,948 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:00:45,949 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:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:00:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-10-15 03:00:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:00:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-10-15 03:00:45,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2019-10-15 03:00:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:45,952 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-10-15 03:00:45,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2019-10-15 03:00:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:00:45,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:45,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:45,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:45,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -333875390, now seen corresponding path program 1 times [2019-10-15 03:00:45,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:45,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632758283] [2019-10-15 03:00:45,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:45,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:45,993 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:45,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632758283] [2019-10-15 03:00:45,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:45,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:45,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588195085] [2019-10-15 03:00:45,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:45,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:45,996 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2019-10-15 03:00:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:46,013 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-15 03:00:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:46,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:00:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:46,014 INFO L225 Difference]: With dead ends: 35 [2019-10-15 03:00:46,014 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:46,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:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:46,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-15 03:00:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:46,016 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:46,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:46,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:46,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:46,038 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:46,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:46,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:46,038 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:46,039 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-15 03:00:46,039 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-10-15 03:00:46,040 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-15 03:00:46,041 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-15 03:00:46,041 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-10-15 03:00:46,041 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-15 03:00:46,041 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,041 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-15 03:00:46,041 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,041 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-15 03:00:46,042 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-15 03:00:46,043 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-15 03:00:46,043 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,043 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-15 03:00:46,043 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-15 03:00:46,043 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-15 03:00:46,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:46 BoogieIcfgContainer [2019-10-15 03:00:46,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:46,057 INFO L168 Benchmark]: Toolchain (without parser) took 2809.82 ms. Allocated memory was 139.5 MB in the beginning and 234.9 MB in the end (delta: 95.4 MB). Free memory was 103.2 MB in the beginning and 120.9 MB in the end (delta: -17.7 MB). Peak memory consumption was 77.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:46,059 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.3 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:46,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.39 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 103.0 MB in the beginning and 180.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:46,065 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 178.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:46,067 INFO L168 Benchmark]: RCFGBuilder took 685.29 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 136.5 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:46,067 INFO L168 Benchmark]: TraceAbstraction took 1732.08 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 135.8 MB in the beginning and 120.9 MB in the end (delta: 14.9 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:46,080 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 351.39 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 103.0 MB in the beginning and 180.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory is still 201.3 MB. Free memory was 180.6 MB in the beginning and 178.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 685.29 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 136.5 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1732.08 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 135.8 MB in the beginning and 120.9 MB in the end (delta: 14.9 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 578 SDtfs, 446 SDslu, 829 SDs, 0 SdLazy, 108 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 12 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 10658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...