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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:54,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:54,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:54,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:54,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:54,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:54,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:54,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:54,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:54,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:54,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:54,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:54,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:54,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:54,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:54,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:54,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:54,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:54,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:54,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:54,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:54,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:54,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:54,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:54,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:54,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:54,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:54,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:54,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:54,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:54,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:54,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:54,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:54,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:54,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:54,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:54,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:54,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:54,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:54,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:54,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:54,082 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:54,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:54,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:54,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:54,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:54,098 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:54,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:54,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:54,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:54,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:54,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:54,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:54,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:54,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:54,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:54,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:54,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:54,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:54,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:54,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:54,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:54,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:54,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:54,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:54,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:54,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:54,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:54,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:54,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:54,103 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:54,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:54,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:54,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:54,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:54,453 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:54,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-15 03:00:54,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8987aea08/c0a49195bc5c4e898f22098df77db142/FLAG639fb398f [2019-10-15 03:00:54,965 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:54,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-15 03:00:54,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8987aea08/c0a49195bc5c4e898f22098df77db142/FLAG639fb398f [2019-10-15 03:00:55,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8987aea08/c0a49195bc5c4e898f22098df77db142 [2019-10-15 03:00:55,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:55,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:55,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:55,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:55,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:55,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:55" (1/1) ... [2019-10-15 03:00:55,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad4c578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:55, skipping insertion in model container [2019-10-15 03:00:55,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:55" (1/1) ... [2019-10-15 03:00:55,369 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:55,394 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:55,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:55,669 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:55,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:55,736 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:55,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:55 WrapperNode [2019-10-15 03:00:55,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:55,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:55,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:55,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:55,895 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:55" (1/1) ... [2019-10-15 03:00:55,895 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:55" (1/1) ... [2019-10-15 03:00:55,902 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:55" (1/1) ... [2019-10-15 03:00:55,904 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:55" (1/1) ... [2019-10-15 03:00:55,917 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:55" (1/1) ... [2019-10-15 03:00:55,924 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:55" (1/1) ... [2019-10-15 03:00:55,928 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:55" (1/1) ... [2019-10-15 03:00:55,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:55,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:55,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:55,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:55,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:55" (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:55,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:56,499 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:56,499 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:56,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:56 BoogieIcfgContainer [2019-10-15 03:00:56,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:56,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:56,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:56,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:56,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:55" (1/3) ... [2019-10-15 03:00:56,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2312b45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:56, skipping insertion in model container [2019-10-15 03:00:56,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:55" (2/3) ... [2019-10-15 03:00:56,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2312b45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:56, skipping insertion in model container [2019-10-15 03:00:56,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:56" (3/3) ... [2019-10-15 03:00:56,509 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-15 03:00:56,519 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:56,527 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:56,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:56,565 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:56,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:56,566 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:56,566 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:56,566 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:56,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:56,566 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:56,567 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-10-15 03:00:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:56,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:56,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:56,593 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 991570927, now seen corresponding path program 1 times [2019-10-15 03:00:56,606 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:56,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855812165] [2019-10-15 03:00:56,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:56,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:56,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:56,790 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:56,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855812165] [2019-10-15 03:00:56,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:56,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:56,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327705693] [2019-10-15 03:00:56,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:56,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:56,816 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-10-15 03:00:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:56,891 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2019-10-15 03:00:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:56,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:56,908 INFO L225 Difference]: With dead ends: 58 [2019-10-15 03:00:56,908 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:56,913 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:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-10-15 03:00:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2019-10-15 03:00:56,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 10 [2019-10-15 03:00:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:56,951 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-10-15 03:00:56,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2019-10-15 03:00:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:56,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:56,952 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:56,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash 674141693, now seen corresponding path program 1 times [2019-10-15 03:00:56,954 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:56,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671019023] [2019-10-15 03:00:56,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:56,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:56,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,021 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:57,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671019023] [2019-10-15 03:00:57,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719308492] [2019-10-15 03:00:57,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,025 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 4 states. [2019-10-15 03:00:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,049 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2019-10-15 03:00:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,052 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:57,052 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:57,053 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:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2019-10-15 03:00:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2019-10-15 03:00:57,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 11 [2019-10-15 03:00:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,060 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2019-10-15 03:00:57,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2019-10-15 03:00:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:57,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,061 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:57,061 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,062 INFO L82 PathProgramCache]: Analyzing trace with hash -576229628, now seen corresponding path program 1 times [2019-10-15 03:00:57,062 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508373297] [2019-10-15 03:00:57,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,111 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:57,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508373297] [2019-10-15 03:00:57,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003243234] [2019-10-15 03:00:57,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,114 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 4 states. [2019-10-15 03:00:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,135 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2019-10-15 03:00:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,136 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:57,137 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:00:57,137 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:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:00:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2019-10-15 03:00:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-10-15 03:00:57,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 12 [2019-10-15 03:00:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,143 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-10-15 03:00:57,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-10-15 03:00:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:57,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:57,144 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -683034574, now seen corresponding path program 1 times [2019-10-15 03:00:57,145 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373109320] [2019-10-15 03:00:57,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,211 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:57,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373109320] [2019-10-15 03:00:57,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822150684] [2019-10-15 03:00:57,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,214 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 4 states. [2019-10-15 03:00:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,241 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2019-10-15 03:00:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,245 INFO L225 Difference]: With dead ends: 39 [2019-10-15 03:00:57,245 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 03:00:57,246 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:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 03:00:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-10-15 03:00:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-10-15 03:00:57,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 13 [2019-10-15 03:00:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,252 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-10-15 03:00:57,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-10-15 03:00:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:57,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,253 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:57,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 300979737, now seen corresponding path program 1 times [2019-10-15 03:00:57,254 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776616022] [2019-10-15 03:00:57,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,301 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:57,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776616022] [2019-10-15 03:00:57,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874539474] [2019-10-15 03:00:57,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,305 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2019-10-15 03:00:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,329 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-10-15 03:00:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,331 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:00:57,331 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 03:00:57,331 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:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 03:00:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-10-15 03:00:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-15 03:00:57,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 14 [2019-10-15 03:00:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,337 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-15 03:00:57,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-10-15 03:00:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:57,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,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:57,339 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 740652647, now seen corresponding path program 1 times [2019-10-15 03:00:57,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665808266] [2019-10-15 03:00:57,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,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:57,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665808266] [2019-10-15 03:00:57,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840967577] [2019-10-15 03:00:57,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,416 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-10-15 03:00:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,442 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-15 03:00:57,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,461 INFO L225 Difference]: With dead ends: 35 [2019-10-15 03:00:57,461 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:00:57,462 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:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:00:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-10-15 03:00:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-15 03:00:57,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 15 [2019-10-15 03:00:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,473 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-15 03:00:57,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-10-15 03:00:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:57,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,478 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:57,478 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1485611310, now seen corresponding path program 1 times [2019-10-15 03:00:57,479 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552233561] [2019-10-15 03:00:57,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,551 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:57,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552233561] [2019-10-15 03:00:57,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362758570] [2019-10-15 03:00:57,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,554 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2019-10-15 03:00:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,590 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-15 03:00:57,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,592 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:00:57,592 INFO L226 Difference]: Without dead ends: 31 [2019-10-15 03:00:57,593 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:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-15 03:00:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-15 03:00:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:00:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-15 03:00:57,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-10-15 03:00:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,600 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-15 03:00:57,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-10-15 03:00:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:57,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:57,603 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:57,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1190473572, now seen corresponding path program 1 times [2019-10-15 03:00:57,604 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:57,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106415970] [2019-10-15 03:00:57,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:57,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:57,676 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:57,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106415970] [2019-10-15 03:00:57,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:57,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:57,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515388732] [2019-10-15 03:00:57,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:57,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:57,678 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2019-10-15 03:00:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:57,694 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-10-15 03:00:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:57,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:57,695 INFO L225 Difference]: With dead ends: 27 [2019-10-15 03:00:57,695 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:57,696 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:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:57,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-15 03:00:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:57,697 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:57,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:57,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:57,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:57,720 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:57,720 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:57,721 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:57,721 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:57,721 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:57,721 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:57,721 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-15 03:00:57,721 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-15 03:00:57,721 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-15 03:00:57,722 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-15 03:00:57,723 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-15 03:00:57,723 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,723 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-15 03:00:57,723 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-15 03:00:57,723 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,723 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,724 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-15 03:00:57,724 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-15 03:00:57,724 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-15 03:00:57,724 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,724 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-15 03:00:57,724 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-15 03:00:57,725 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-15 03:00:57,725 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-15 03:00:57,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:57 BoogieIcfgContainer [2019-10-15 03:00:57,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:57,739 INFO L168 Benchmark]: Toolchain (without parser) took 2384.05 ms. Allocated memory was 137.4 MB in the beginning and 234.9 MB in the end (delta: 97.5 MB). Free memory was 102.6 MB in the beginning and 184.2 MB in the end (delta: -81.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:57,745 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 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:57,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.32 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:57,747 INFO L168 Benchmark]: Boogie Preprocessor took 200.75 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 92.0 MB in the beginning and 182.2 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:57,749 INFO L168 Benchmark]: RCFGBuilder took 561.90 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 154.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:57,749 INFO L168 Benchmark]: TraceAbstraction took 1232.18 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 154.1 MB in the beginning and 184.2 MB in the end (delta: -30.1 MB). Peak memory consumption was 316.1 kB. Max. memory is 7.1 GB. [2019-10-15 03:00:57,762 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.32 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 92.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 200.75 ms. Allocated memory was 137.4 MB in the beginning and 204.5 MB in the end (delta: 67.1 MB). Free memory was 92.0 MB in the beginning and 182.2 MB in the end (delta: -90.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 561.90 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 154.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1232.18 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 154.1 MB in the beginning and 184.2 MB in the end (delta: -30.1 MB). Peak memory consumption was 316.1 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 30 locations, 1 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 276 SDtfs, 202 SDslu, 379 SDs, 0 SdLazy, 72 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 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.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 4444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...