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 -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:51,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:51,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:51,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:51,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:51,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:51,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:51,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:51,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:51,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:51,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:51,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:51,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:51,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:51,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:51,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:51,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:51,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:51,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:51,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:51,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:51,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:51,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:51,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:51,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:51,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:51,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:51,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:51,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:51,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:51,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:51,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:51,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:51,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:51,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:51,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:51,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:51,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:51,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:51,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:51,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:51,415 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-14 23:13:51,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:51,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:51,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:51,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:51,442 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:51,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:51,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:51,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:51,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:51,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:51,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:51,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:51,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:51,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:51,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:51,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:51,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:51,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:51,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:51,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:51,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:51,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:51,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:51,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:51,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:51,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:51,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:51,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:51,741 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:51,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2019-10-14 23:13:51,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26b5e95b/c7edb1b3b7464e2887db28ad23f494fb/FLAG165a60301 [2019-10-14 23:13:52,237 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:52,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2019-10-14 23:13:52,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26b5e95b/c7edb1b3b7464e2887db28ad23f494fb/FLAG165a60301 [2019-10-14 23:13:52,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26b5e95b/c7edb1b3b7464e2887db28ad23f494fb [2019-10-14 23:13:52,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:52,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:52,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:52,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:52,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:52,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d996306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52, skipping insertion in model container [2019-10-14 23:13:52,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:52,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:52,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:52,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:52,880 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:52,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:52,911 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:52,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52 WrapperNode [2019-10-14 23:13:52,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:52,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:52,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:52,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:53,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (1/1) ... [2019-10-14 23:13:53,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:53,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:53,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:53,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:53,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (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-14 23:13:53,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:53,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:53,092 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:53,407 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:53,407 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:53,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:53 BoogieIcfgContainer [2019-10-14 23:13:53,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:53,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:53,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:53,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:53,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:52" (1/3) ... [2019-10-14 23:13:53,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:53, skipping insertion in model container [2019-10-14 23:13:53,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:52" (2/3) ... [2019-10-14 23:13:53,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:53, skipping insertion in model container [2019-10-14 23:13:53,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:53" (3/3) ... [2019-10-14 23:13:53,420 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-10-14 23:13:53,430 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:53,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:53,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:53,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:53,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:53,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:53,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:53,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:53,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:53,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:53,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-14 23:13:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:13:53,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,505 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2019-10-14 23:13:53,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080739525] [2019-10-14 23:13:53,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,684 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-14 23:13:53,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080739525] [2019-10-14 23:13:53,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676040931] [2019-10-14 23:13:53,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,705 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-10-14 23:13:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,775 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2019-10-14 23:13:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:13:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,787 INFO L225 Difference]: With dead ends: 63 [2019-10-14 23:13:53,787 INFO L226 Difference]: Without dead ends: 48 [2019-10-14 23:13:53,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-14 23:13:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-10-14 23:13:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:13:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2019-10-14 23:13:53,828 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2019-10-14 23:13:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,828 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2019-10-14 23:13:53,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2019-10-14 23:13:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:13:53,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2019-10-14 23:13:53,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227816891] [2019-10-14 23:13:53,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,880 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-14 23:13:53,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227816891] [2019-10-14 23:13:53,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331730784] [2019-10-14 23:13:53,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,885 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2019-10-14 23:13:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,933 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2019-10-14 23:13:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:13:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,935 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:13:53,935 INFO L226 Difference]: Without dead ends: 48 [2019-10-14 23:13:53,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-14 23:13:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-14 23:13:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:13:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2019-10-14 23:13:53,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2019-10-14 23:13:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,946 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2019-10-14 23:13:53,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2019-10-14 23:13:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:53,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2019-10-14 23:13:53,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042576385] [2019-10-14 23:13:53,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,002 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-14 23:13:54,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042576385] [2019-10-14 23:13:54,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490292101] [2019-10-14 23:13:54,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,009 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2019-10-14 23:13:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,030 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2019-10-14 23:13:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,032 INFO L225 Difference]: With dead ends: 72 [2019-10-14 23:13:54,032 INFO L226 Difference]: Without dead ends: 51 [2019-10-14 23:13:54,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-14 23:13:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-10-14 23:13:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 23:13:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-10-14 23:13:54,042 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2019-10-14 23:13:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,042 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-10-14 23:13:54,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-10-14 23:13:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:54,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,044 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2019-10-14 23:13:54,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409017451] [2019-10-14 23:13:54,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,081 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-14 23:13:54,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409017451] [2019-10-14 23:13:54,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334158886] [2019-10-14 23:13:54,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,084 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2019-10-14 23:13:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,103 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2019-10-14 23:13:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,105 INFO L225 Difference]: With dead ends: 88 [2019-10-14 23:13:54,105 INFO L226 Difference]: Without dead ends: 86 [2019-10-14 23:13:54,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-14 23:13:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2019-10-14 23:13:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:13:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2019-10-14 23:13:54,116 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2019-10-14 23:13:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,117 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2019-10-14 23:13:54,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2019-10-14 23:13:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:13:54,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2019-10-14 23:13:54,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940679583] [2019-10-14 23:13:54,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,184 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-14 23:13:54,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940679583] [2019-10-14 23:13:54,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291973029] [2019-10-14 23:13:54,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,190 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2019-10-14 23:13:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,220 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2019-10-14 23:13:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:13:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,224 INFO L225 Difference]: With dead ends: 144 [2019-10-14 23:13:54,225 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 23:13:54,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 23:13:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-10-14 23:13:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 23:13:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2019-10-14 23:13:54,235 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2019-10-14 23:13:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,236 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2019-10-14 23:13:54,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2019-10-14 23:13:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:54,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,237 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-14 23:13:54,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2019-10-14 23:13:54,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630258173] [2019-10-14 23:13:54,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,274 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-14 23:13:54,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630258173] [2019-10-14 23:13:54,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754018844] [2019-10-14 23:13:54,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,277 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2019-10-14 23:13:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,298 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2019-10-14 23:13:54,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,301 INFO L225 Difference]: With dead ends: 129 [2019-10-14 23:13:54,301 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 23:13:54,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 23:13:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-14 23:13:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 23:13:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2019-10-14 23:13:54,314 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2019-10-14 23:13:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,315 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2019-10-14 23:13:54,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2019-10-14 23:13:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:54,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,320 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-14 23:13:54,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2019-10-14 23:13:54,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899428774] [2019-10-14 23:13:54,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,374 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-14 23:13:54,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899428774] [2019-10-14 23:13:54,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352963646] [2019-10-14 23:13:54,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,376 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2019-10-14 23:13:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,393 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2019-10-14 23:13:54,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,395 INFO L225 Difference]: With dead ends: 156 [2019-10-14 23:13:54,395 INFO L226 Difference]: Without dead ends: 154 [2019-10-14 23:13:54,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-14 23:13:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2019-10-14 23:13:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-14 23:13:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2019-10-14 23:13:54,408 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2019-10-14 23:13:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,409 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2019-10-14 23:13:54,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2019-10-14 23:13:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:13:54,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,411 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-14 23:13:54,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2019-10-14 23:13:54,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258388257] [2019-10-14 23:13:54,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,450 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-14 23:13:54,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258388257] [2019-10-14 23:13:54,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302816590] [2019-10-14 23:13:54,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,453 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2019-10-14 23:13:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,486 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2019-10-14 23:13:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-14 23:13:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,489 INFO L225 Difference]: With dead ends: 272 [2019-10-14 23:13:54,489 INFO L226 Difference]: Without dead ends: 162 [2019-10-14 23:13:54,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-14 23:13:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-14 23:13:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-14 23:13:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2019-10-14 23:13:54,505 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2019-10-14 23:13:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,505 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2019-10-14 23:13:54,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2019-10-14 23:13:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,507 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-14 23:13:54,508 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2019-10-14 23:13:54,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111430958] [2019-10-14 23:13:54,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,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-14 23:13:54,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111430958] [2019-10-14 23:13:54,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854177245] [2019-10-14 23:13:54,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,547 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2019-10-14 23:13:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,584 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2019-10-14 23:13:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,586 INFO L225 Difference]: With dead ends: 240 [2019-10-14 23:13:54,587 INFO L226 Difference]: Without dead ends: 166 [2019-10-14 23:13:54,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-14 23:13:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-10-14 23:13:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-14 23:13:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2019-10-14 23:13:54,598 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2019-10-14 23:13:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,598 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2019-10-14 23:13:54,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2019-10-14 23:13:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,600 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-14 23:13:54,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2019-10-14 23:13:54,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554392831] [2019-10-14 23:13:54,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,629 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-14 23:13:54,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554392831] [2019-10-14 23:13:54,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163684374] [2019-10-14 23:13:54,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,633 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2019-10-14 23:13:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,667 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2019-10-14 23:13:54,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,669 INFO L225 Difference]: With dead ends: 284 [2019-10-14 23:13:54,669 INFO L226 Difference]: Without dead ends: 282 [2019-10-14 23:13:54,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-14 23:13:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-14 23:13:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-14 23:13:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2019-10-14 23:13:54,691 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2019-10-14 23:13:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,693 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2019-10-14 23:13:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2019-10-14 23:13:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:13:54,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,695 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-14 23:13:54,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2019-10-14 23:13:54,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843023198] [2019-10-14 23:13:54,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,734 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-14 23:13:54,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843023198] [2019-10-14 23:13:54,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561622282] [2019-10-14 23:13:54,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,736 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2019-10-14 23:13:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,779 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2019-10-14 23:13:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:13:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,784 INFO L225 Difference]: With dead ends: 524 [2019-10-14 23:13:54,784 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:13:54,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:13:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-14 23:13:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:13:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2019-10-14 23:13:54,815 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2019-10-14 23:13:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,815 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2019-10-14 23:13:54,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2019-10-14 23:13:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:54,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,826 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-14 23:13:54,826 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2019-10-14 23:13:54,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361922897] [2019-10-14 23:13:54,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,865 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-14 23:13:54,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361922897] [2019-10-14 23:13:54,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989344989] [2019-10-14 23:13:54,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,871 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2019-10-14 23:13:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,890 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2019-10-14 23:13:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,894 INFO L225 Difference]: With dead ends: 456 [2019-10-14 23:13:54,895 INFO L226 Difference]: Without dead ends: 314 [2019-10-14 23:13:54,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-14 23:13:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-10-14 23:13:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-14 23:13:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2019-10-14 23:13:54,910 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2019-10-14 23:13:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,911 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2019-10-14 23:13:54,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2019-10-14 23:13:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:54,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,912 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-14 23:13:54,912 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2019-10-14 23:13:54,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307992915] [2019-10-14 23:13:54,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,961 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-14 23:13:54,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307992915] [2019-10-14 23:13:54,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587961687] [2019-10-14 23:13:54,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,967 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2019-10-14 23:13:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,995 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2019-10-14 23:13:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,999 INFO L225 Difference]: With dead ends: 524 [2019-10-14 23:13:54,999 INFO L226 Difference]: Without dead ends: 522 [2019-10-14 23:13:55,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-10-14 23:13:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2019-10-14 23:13:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-14 23:13:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2019-10-14 23:13:55,016 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2019-10-14 23:13:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,016 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2019-10-14 23:13:55,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2019-10-14 23:13:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:55,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,020 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-14 23:13:55,020 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2019-10-14 23:13:55,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717793160] [2019-10-14 23:13:55,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,044 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-14 23:13:55,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717793160] [2019-10-14 23:13:55,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033567203] [2019-10-14 23:13:55,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,048 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2019-10-14 23:13:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,078 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2019-10-14 23:13:55,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,082 INFO L225 Difference]: With dead ends: 1020 [2019-10-14 23:13:55,082 INFO L226 Difference]: Without dead ends: 586 [2019-10-14 23:13:55,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-14 23:13:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-14 23:13:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-14 23:13:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2019-10-14 23:13:55,105 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2019-10-14 23:13:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,106 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2019-10-14 23:13:55,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2019-10-14 23:13:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,108 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-14 23:13:55,108 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2019-10-14 23:13:55,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192276418] [2019-10-14 23:13:55,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,142 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-14 23:13:55,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192276418] [2019-10-14 23:13:55,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408088976] [2019-10-14 23:13:55,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,145 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2019-10-14 23:13:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,166 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2019-10-14 23:13:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,170 INFO L225 Difference]: With dead ends: 876 [2019-10-14 23:13:55,170 INFO L226 Difference]: Without dead ends: 602 [2019-10-14 23:13:55,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-14 23:13:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-14 23:13:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-14 23:13:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2019-10-14 23:13:55,190 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2019-10-14 23:13:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,191 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2019-10-14 23:13:55,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2019-10-14 23:13:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,192 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-14 23:13:55,192 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2019-10-14 23:13:55,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138222696] [2019-10-14 23:13:55,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,210 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-14 23:13:55,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138222696] [2019-10-14 23:13:55,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23750347] [2019-10-14 23:13:55,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,212 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2019-10-14 23:13:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,242 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2019-10-14 23:13:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,247 INFO L225 Difference]: With dead ends: 970 [2019-10-14 23:13:55,247 INFO L226 Difference]: Without dead ends: 968 [2019-10-14 23:13:55,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-14 23:13:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2019-10-14 23:13:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-14 23:13:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2019-10-14 23:13:55,280 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2019-10-14 23:13:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,280 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2019-10-14 23:13:55,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2019-10-14 23:13:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:55,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,283 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-14 23:13:55,284 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2019-10-14 23:13:55,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785088413] [2019-10-14 23:13:55,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,305 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-14 23:13:55,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785088413] [2019-10-14 23:13:55,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70281011] [2019-10-14 23:13:55,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,308 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2019-10-14 23:13:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,354 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2019-10-14 23:13:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,355 INFO L225 Difference]: With dead ends: 1992 [2019-10-14 23:13:55,355 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:55,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:55,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-14 23:13:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,362 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:55,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:55,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:55,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:55,387 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:55,387 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:55,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:55,388 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:55,388 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:55,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:55,388 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-14 23:13:55,389 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2019-10-14 23:13:55,389 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,389 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-14 23:13:55,389 INFO L446 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-10-14 23:13:55,389 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L443 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,390 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2019-10-14 23:13:55,391 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-14 23:13:55,391 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,391 INFO L446 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-10-14 23:13:55,391 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-14 23:13:55,391 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-14 23:13:55,392 INFO L439 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-10-14 23:13:55,392 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,392 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,392 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,392 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-14 23:13:55,392 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,393 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-14 23:13:55,393 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-10-14 23:13:55,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:55 BoogieIcfgContainer [2019-10-14 23:13:55,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:55,405 INFO L168 Benchmark]: Toolchain (without parser) took 2765.73 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 102.7 MB in the beginning and 85.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:55,406 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 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-14 23:13:55,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.37 ms. Allocated memory is still 145.2 MB. Free memory was 102.5 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-14 23:13:55,408 INFO L168 Benchmark]: Boogie Preprocessor took 119.75 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:55,409 INFO L168 Benchmark]: RCFGBuilder took 377.75 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 165.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:55,410 INFO L168 Benchmark]: TraceAbstraction took 1991.02 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 165.0 MB in the beginning and 85.1 MB in the end (delta: 79.9 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:55,414 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 145.2 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 269.37 ms. Allocated memory is still 145.2 MB. Free memory was 102.5 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 119.75 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 180.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.75 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 165.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1991.02 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 165.0 MB in the beginning and 85.1 MB in the end (delta: 79.9 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...