java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:49:39,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:49:39,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:49:39,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:49:39,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:49:39,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:49:39,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:49:39,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:49:39,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:49:39,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:49:39,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:49:39,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:49:39,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:49:39,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:49:39,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:49:39,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:49:39,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:49:39,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:49:39,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:49:39,470 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:49:39,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:49:39,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:49:39,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:49:39,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:49:39,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:49:39,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:49:39,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:49:39,473 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:49:39,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:49:39,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:49:39,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:49:39,474 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:49:39,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:49:39,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:49:39,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:49:39,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:49:39,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:49:39,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:49:39,480 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:49:39,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:49:39,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:49:39,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:49:39,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:49:39,482 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:49:39,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:49:39,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:49:39,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:49:39,483 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:49:39,483 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:49:39,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:49:39,509 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:49:39,511 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:49:39,512 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:49:39,512 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:49:39,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 01:49:39,577 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:49:39,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:49:39,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:49:39,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:49:39,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:49:39,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b37cb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39, skipping insertion in model container [2018-01-30 01:49:39,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,593 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:49:39,604 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:49:39,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:49:39,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:49:39,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39 WrapperNode [2018-01-30 01:49:39,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:49:39,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:49:39,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:49:39,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:49:39,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... [2018-01-30 01:49:39,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:49:39,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:49:39,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:49:39,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:49:39,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-30 01:49:39,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:49:39,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:49:39,799 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:49:39,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:49:39,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:49:39,799 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:49:39,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:49:39,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:49:40,197 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:49:40,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:49:40 BoogieIcfgContainer [2018-01-30 01:49:40,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:49:40,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:49:40,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:49:40,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:49:40,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:49:39" (1/3) ... [2018-01-30 01:49:40,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ebaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:49:40, skipping insertion in model container [2018-01-30 01:49:40,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:49:39" (2/3) ... [2018-01-30 01:49:40,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ebaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:49:40, skipping insertion in model container [2018-01-30 01:49:40,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:49:40" (3/3) ... [2018-01-30 01:49:40,203 INFO L107 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 01:49:40,208 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:49:40,213 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:49:40,238 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:49:40,238 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:49:40,238 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:49:40,238 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:49:40,238 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:49:40,239 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:49:40,239 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:49:40,239 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:49:40,239 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:49:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-01-30 01:49:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 01:49:40,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:40,255 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:40,255 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 01:49:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1724013625, now seen corresponding path program 1 times [2018-01-30 01:49:40,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:40,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:40,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:40,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:40,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:40,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:40,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:40,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:40,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:40,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,443 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-01-30 01:49:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:40,533 INFO L93 Difference]: Finished difference Result 284 states and 389 transitions. [2018-01-30 01:49:40,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:40,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-01-30 01:49:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:40,541 INFO L225 Difference]: With dead ends: 284 [2018-01-30 01:49:40,541 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 01:49:40,543 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 01:49:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-01-30 01:49:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-30 01:49:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2018-01-30 01:49:40,628 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 80 [2018-01-30 01:49:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:40,629 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2018-01-30 01:49:40,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2018-01-30 01:49:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 01:49:40,630 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:40,630 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:40,630 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 01:49:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1329892545, now seen corresponding path program 1 times [2018-01-30 01:49:40,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:40,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:40,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:40,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:40,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:40,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:40,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:40,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:40,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:40,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,712 INFO L87 Difference]: Start difference. First operand 192 states and 254 transitions. Second operand 3 states. [2018-01-30 01:49:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:40,758 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2018-01-30 01:49:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:40,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-01-30 01:49:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:40,759 INFO L225 Difference]: With dead ends: 233 [2018-01-30 01:49:40,760 INFO L226 Difference]: Without dead ends: 231 [2018-01-30 01:49:40,760 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-01-30 01:49:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 192. [2018-01-30 01:49:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-30 01:49:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 253 transitions. [2018-01-30 01:49:40,768 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 253 transitions. Word has length 81 [2018-01-30 01:49:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:40,768 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 253 transitions. [2018-01-30 01:49:40,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 253 transitions. [2018-01-30 01:49:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 01:49:40,769 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:40,770 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:40,770 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 01:49:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1904571244, now seen corresponding path program 1 times [2018-01-30 01:49:40,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:40,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:40,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:40,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:40,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:40,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:40,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:40,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:40,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:40,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,821 INFO L87 Difference]: Start difference. First operand 192 states and 253 transitions. Second operand 3 states. [2018-01-30 01:49:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:40,852 INFO L93 Difference]: Finished difference Result 472 states and 653 transitions. [2018-01-30 01:49:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:40,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-01-30 01:49:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:40,854 INFO L225 Difference]: With dead ends: 472 [2018-01-30 01:49:40,854 INFO L226 Difference]: Without dead ends: 329 [2018-01-30 01:49:40,855 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-30 01:49:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2018-01-30 01:49:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-30 01:49:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 444 transitions. [2018-01-30 01:49:40,869 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 444 transitions. Word has length 81 [2018-01-30 01:49:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:40,869 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 444 transitions. [2018-01-30 01:49:40,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 444 transitions. [2018-01-30 01:49:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 01:49:40,870 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:40,871 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:40,871 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 01:49:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1658138625, now seen corresponding path program 1 times [2018-01-30 01:49:40,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:40,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:40,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:40,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:40,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:40,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:40,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:40,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:40,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:40,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,918 INFO L87 Difference]: Start difference. First operand 327 states and 444 transitions. Second operand 3 states. [2018-01-30 01:49:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:40,932 INFO L93 Difference]: Finished difference Result 401 states and 552 transitions. [2018-01-30 01:49:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:40,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-01-30 01:49:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:40,934 INFO L225 Difference]: With dead ends: 401 [2018-01-30 01:49:40,934 INFO L226 Difference]: Without dead ends: 399 [2018-01-30 01:49:40,934 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-01-30 01:49:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 327. [2018-01-30 01:49:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-30 01:49:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 442 transitions. [2018-01-30 01:49:40,943 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 442 transitions. Word has length 82 [2018-01-30 01:49:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:40,943 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 442 transitions. [2018-01-30 01:49:40,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 442 transitions. [2018-01-30 01:49:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 01:49:40,946 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:40,946 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:40,946 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 01:49:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1088077531, now seen corresponding path program 1 times [2018-01-30 01:49:40,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:40,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:40,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:40,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:40,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,008 INFO L87 Difference]: Start difference. First operand 327 states and 442 transitions. Second operand 3 states. [2018-01-30 01:49:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,057 INFO L93 Difference]: Finished difference Result 871 states and 1212 transitions. [2018-01-30 01:49:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-01-30 01:49:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,059 INFO L225 Difference]: With dead ends: 871 [2018-01-30 01:49:41,059 INFO L226 Difference]: Without dead ends: 593 [2018-01-30 01:49:41,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-01-30 01:49:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2018-01-30 01:49:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-01-30 01:49:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 810 transitions. [2018-01-30 01:49:41,069 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 810 transitions. Word has length 82 [2018-01-30 01:49:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,069 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 810 transitions. [2018-01-30 01:49:41,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 810 transitions. [2018-01-30 01:49:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 01:49:41,070 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,070 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,070 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash -629090584, now seen corresponding path program 1 times [2018-01-30 01:49:41,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,126 INFO L87 Difference]: Start difference. First operand 591 states and 810 transitions. Second operand 3 states. [2018-01-30 01:49:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,191 INFO L93 Difference]: Finished difference Result 1651 states and 2300 transitions. [2018-01-30 01:49:41,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-01-30 01:49:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,194 INFO L225 Difference]: With dead ends: 1651 [2018-01-30 01:49:41,194 INFO L226 Difference]: Without dead ends: 1109 [2018-01-30 01:49:41,195 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-01-30 01:49:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1107. [2018-01-30 01:49:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2018-01-30 01:49:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1522 transitions. [2018-01-30 01:49:41,208 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1522 transitions. Word has length 83 [2018-01-30 01:49:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,208 INFO L432 AbstractCegarLoop]: Abstraction has 1107 states and 1522 transitions. [2018-01-30 01:49:41,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1522 transitions. [2018-01-30 01:49:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 01:49:41,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,209 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,210 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash -202175245, now seen corresponding path program 1 times [2018-01-30 01:49:41,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,268 INFO L87 Difference]: Start difference. First operand 1107 states and 1522 transitions. Second operand 3 states. [2018-01-30 01:49:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,315 INFO L93 Difference]: Finished difference Result 1367 states and 1900 transitions. [2018-01-30 01:49:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-01-30 01:49:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,319 INFO L225 Difference]: With dead ends: 1367 [2018-01-30 01:49:41,319 INFO L226 Difference]: Without dead ends: 1365 [2018-01-30 01:49:41,319 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2018-01-30 01:49:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1107. [2018-01-30 01:49:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2018-01-30 01:49:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1514 transitions. [2018-01-30 01:49:41,333 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1514 transitions. Word has length 83 [2018-01-30 01:49:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,334 INFO L432 AbstractCegarLoop]: Abstraction has 1107 states and 1514 transitions. [2018-01-30 01:49:41,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1514 transitions. [2018-01-30 01:49:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 01:49:41,334 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,335 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,335 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2037329995, now seen corresponding path program 1 times [2018-01-30 01:49:41,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,391 INFO L87 Difference]: Start difference. First operand 1107 states and 1514 transitions. Second operand 3 states. [2018-01-30 01:49:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,446 INFO L93 Difference]: Finished difference Result 1359 states and 1876 transitions. [2018-01-30 01:49:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-01-30 01:49:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,449 INFO L225 Difference]: With dead ends: 1359 [2018-01-30 01:49:41,449 INFO L226 Difference]: Without dead ends: 1357 [2018-01-30 01:49:41,450 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2018-01-30 01:49:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1107. [2018-01-30 01:49:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2018-01-30 01:49:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1506 transitions. [2018-01-30 01:49:41,463 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1506 transitions. Word has length 84 [2018-01-30 01:49:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,464 INFO L432 AbstractCegarLoop]: Abstraction has 1107 states and 1506 transitions. [2018-01-30 01:49:41,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1506 transitions. [2018-01-30 01:49:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 01:49:41,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,465 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,465 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1973273071, now seen corresponding path program 1 times [2018-01-30 01:49:41,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,528 INFO L87 Difference]: Start difference. First operand 1107 states and 1506 transitions. Second operand 3 states. [2018-01-30 01:49:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,607 INFO L93 Difference]: Finished difference Result 3175 states and 4356 transitions. [2018-01-30 01:49:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-01-30 01:49:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,611 INFO L225 Difference]: With dead ends: 3175 [2018-01-30 01:49:41,611 INFO L226 Difference]: Without dead ends: 2117 [2018-01-30 01:49:41,613 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2018-01-30 01:49:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2115. [2018-01-30 01:49:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-01-30 01:49:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2866 transitions. [2018-01-30 01:49:41,639 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2866 transitions. Word has length 84 [2018-01-30 01:49:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,639 INFO L432 AbstractCegarLoop]: Abstraction has 2115 states and 2866 transitions. [2018-01-30 01:49:41,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2866 transitions. [2018-01-30 01:49:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-30 01:49:41,640 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,640 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,640 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1202415271, now seen corresponding path program 1 times [2018-01-30 01:49:41,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,694 INFO L87 Difference]: Start difference. First operand 2115 states and 2866 transitions. Second operand 3 states. [2018-01-30 01:49:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,755 INFO L93 Difference]: Finished difference Result 2583 states and 3524 transitions. [2018-01-30 01:49:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-01-30 01:49:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,760 INFO L225 Difference]: With dead ends: 2583 [2018-01-30 01:49:41,760 INFO L226 Difference]: Without dead ends: 2581 [2018-01-30 01:49:41,761 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2018-01-30 01:49:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2115. [2018-01-30 01:49:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-01-30 01:49:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2850 transitions. [2018-01-30 01:49:41,788 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2850 transitions. Word has length 85 [2018-01-30 01:49:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:41,788 INFO L432 AbstractCegarLoop]: Abstraction has 2115 states and 2850 transitions. [2018-01-30 01:49:41,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2850 transitions. [2018-01-30 01:49:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-30 01:49:41,789 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:41,789 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:41,789 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 01:49:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1042168124, now seen corresponding path program 1 times [2018-01-30 01:49:41,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:41,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:41,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:41,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:41,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:41,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:41,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:41,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:41,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:41,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,842 INFO L87 Difference]: Start difference. First operand 2115 states and 2850 transitions. Second operand 3 states. [2018-01-30 01:49:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:41,931 INFO L93 Difference]: Finished difference Result 6151 states and 8324 transitions. [2018-01-30 01:49:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:41,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-01-30 01:49:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:41,940 INFO L225 Difference]: With dead ends: 6151 [2018-01-30 01:49:41,940 INFO L226 Difference]: Without dead ends: 4085 [2018-01-30 01:49:41,942 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2018-01-30 01:49:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 4083. [2018-01-30 01:49:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4083 states. [2018-01-30 01:49:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5458 transitions. [2018-01-30 01:49:42,005 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5458 transitions. Word has length 85 [2018-01-30 01:49:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:42,006 INFO L432 AbstractCegarLoop]: Abstraction has 4083 states and 5458 transitions. [2018-01-30 01:49:42,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5458 transitions. [2018-01-30 01:49:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 01:49:42,007 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:42,008 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:42,008 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 01:49:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1444696215, now seen corresponding path program 1 times [2018-01-30 01:49:42,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:42,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:42,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:42,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:42,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:42,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:42,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:42,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:42,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:42,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,072 INFO L87 Difference]: Start difference. First operand 4083 states and 5458 transitions. Second operand 3 states. [2018-01-30 01:49:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:42,150 INFO L93 Difference]: Finished difference Result 4951 states and 6644 transitions. [2018-01-30 01:49:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:42,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-01-30 01:49:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:42,160 INFO L225 Difference]: With dead ends: 4951 [2018-01-30 01:49:42,160 INFO L226 Difference]: Without dead ends: 4949 [2018-01-30 01:49:42,162 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2018-01-30 01:49:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4083. [2018-01-30 01:49:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4083 states. [2018-01-30 01:49:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5426 transitions. [2018-01-30 01:49:42,217 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5426 transitions. Word has length 86 [2018-01-30 01:49:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:42,217 INFO L432 AbstractCegarLoop]: Abstraction has 4083 states and 5426 transitions. [2018-01-30 01:49:42,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5426 transitions. [2018-01-30 01:49:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-30 01:49:42,219 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:42,219 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:42,219 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 01:49:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2052281085, now seen corresponding path program 1 times [2018-01-30 01:49:42,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:42,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:42,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:42,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:42,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:42,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:42,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:42,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:42,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:42,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,278 INFO L87 Difference]: Start difference. First operand 4083 states and 5426 transitions. Second operand 3 states. [2018-01-30 01:49:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:42,413 INFO L93 Difference]: Finished difference Result 11959 states and 15924 transitions. [2018-01-30 01:49:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:42,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-01-30 01:49:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:42,426 INFO L225 Difference]: With dead ends: 11959 [2018-01-30 01:49:42,427 INFO L226 Difference]: Without dead ends: 7925 [2018-01-30 01:49:42,431 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7925 states. [2018-01-30 01:49:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7925 to 7923. [2018-01-30 01:49:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7923 states. [2018-01-30 01:49:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7923 states to 7923 states and 10418 transitions. [2018-01-30 01:49:42,524 INFO L78 Accepts]: Start accepts. Automaton has 7923 states and 10418 transitions. Word has length 86 [2018-01-30 01:49:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:42,525 INFO L432 AbstractCegarLoop]: Abstraction has 7923 states and 10418 transitions. [2018-01-30 01:49:42,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7923 states and 10418 transitions. [2018-01-30 01:49:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 01:49:42,528 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:42,528 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:42,528 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 01:49:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1900773285, now seen corresponding path program 1 times [2018-01-30 01:49:42,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:42,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:42,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:42,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:42,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:42,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:42,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:42,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:42,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:42,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,585 INFO L87 Difference]: Start difference. First operand 7923 states and 10418 transitions. Second operand 3 states. [2018-01-30 01:49:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:42,667 INFO L93 Difference]: Finished difference Result 9527 states and 12532 transitions. [2018-01-30 01:49:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:42,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-01-30 01:49:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:42,687 INFO L225 Difference]: With dead ends: 9527 [2018-01-30 01:49:42,687 INFO L226 Difference]: Without dead ends: 9525 [2018-01-30 01:49:42,693 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9525 states. [2018-01-30 01:49:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9525 to 7923. [2018-01-30 01:49:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7923 states. [2018-01-30 01:49:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7923 states to 7923 states and 10354 transitions. [2018-01-30 01:49:42,793 INFO L78 Accepts]: Start accepts. Automaton has 7923 states and 10354 transitions. Word has length 87 [2018-01-30 01:49:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:42,793 INFO L432 AbstractCegarLoop]: Abstraction has 7923 states and 10354 transitions. [2018-01-30 01:49:42,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7923 states and 10354 transitions. [2018-01-30 01:49:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 01:49:42,796 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:42,796 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:42,796 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-30 01:49:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash 804041616, now seen corresponding path program 1 times [2018-01-30 01:49:42,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:42,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:42,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:42,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:42,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:42,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:42,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:42,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:42,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:42,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:42,853 INFO L87 Difference]: Start difference. First operand 7923 states and 10354 transitions. Second operand 3 states. [2018-01-30 01:49:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:42,975 INFO L93 Difference]: Finished difference Result 23287 states and 30452 transitions. [2018-01-30 01:49:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:42,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-01-30 01:49:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:42,991 INFO L225 Difference]: With dead ends: 23287 [2018-01-30 01:49:42,991 INFO L226 Difference]: Without dead ends: 15413 [2018-01-30 01:49:43,001 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2018-01-30 01:49:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 15411. [2018-01-30 01:49:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15411 states. [2018-01-30 01:49:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15411 states to 15411 states and 19890 transitions. [2018-01-30 01:49:43,173 INFO L78 Accepts]: Start accepts. Automaton has 15411 states and 19890 transitions. Word has length 87 [2018-01-30 01:49:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:43,173 INFO L432 AbstractCegarLoop]: Abstraction has 15411 states and 19890 transitions. [2018-01-30 01:49:43,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15411 states and 19890 transitions. [2018-01-30 01:49:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 01:49:43,178 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:43,178 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:43,178 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation]=== [2018-01-30 01:49:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1140707101, now seen corresponding path program 1 times [2018-01-30 01:49:43,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:43,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:43,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:43,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:43,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:43,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:43,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:43,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:43,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:43,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:43,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:43,229 INFO L87 Difference]: Start difference. First operand 15411 states and 19890 transitions. Second operand 3 states. [2018-01-30 01:49:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:43,343 INFO L93 Difference]: Finished difference Result 18359 states and 23604 transitions. [2018-01-30 01:49:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:43,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-01-30 01:49:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:43,361 INFO L225 Difference]: With dead ends: 18359 [2018-01-30 01:49:43,361 INFO L226 Difference]: Without dead ends: 18357 [2018-01-30 01:49:43,365 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18357 states. [2018-01-30 01:49:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18357 to 15411. [2018-01-30 01:49:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15411 states. [2018-01-30 01:49:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15411 states to 15411 states and 19762 transitions. [2018-01-30 01:49:43,589 INFO L78 Accepts]: Start accepts. Automaton has 15411 states and 19762 transitions. Word has length 88 [2018-01-30 01:49:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:43,590 INFO L432 AbstractCegarLoop]: Abstraction has 15411 states and 19762 transitions. [2018-01-30 01:49:43,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15411 states and 19762 transitions. [2018-01-30 01:49:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 01:49:43,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:43,595 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:43,595 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation]=== [2018-01-30 01:49:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -844267497, now seen corresponding path program 1 times [2018-01-30 01:49:43,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:43,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:43,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:43,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:43,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:43,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:43,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:43,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:43,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:43,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:43,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:43,668 INFO L87 Difference]: Start difference. First operand 15411 states and 19762 transitions. Second operand 3 states. [2018-01-30 01:49:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:44,125 INFO L93 Difference]: Finished difference Result 45367 states and 58164 transitions. [2018-01-30 01:49:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:44,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-01-30 01:49:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:44,153 INFO L225 Difference]: With dead ends: 45367 [2018-01-30 01:49:44,153 INFO L226 Difference]: Without dead ends: 30005 [2018-01-30 01:49:44,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30005 states. [2018-01-30 01:49:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30005 to 30003. [2018-01-30 01:49:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30003 states. [2018-01-30 01:49:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30003 states to 30003 states and 37938 transitions. [2018-01-30 01:49:44,480 INFO L78 Accepts]: Start accepts. Automaton has 30003 states and 37938 transitions. Word has length 88 [2018-01-30 01:49:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:44,480 INFO L432 AbstractCegarLoop]: Abstraction has 30003 states and 37938 transitions. [2018-01-30 01:49:44,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30003 states and 37938 transitions. [2018-01-30 01:49:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-30 01:49:44,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:44,489 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:44,489 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation]=== [2018-01-30 01:49:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash 937318927, now seen corresponding path program 1 times [2018-01-30 01:49:44,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:44,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:44,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:44,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:44,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:44,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:44,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:44,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:44,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:44,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:44,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:44,540 INFO L87 Difference]: Start difference. First operand 30003 states and 37938 transitions. Second operand 3 states. [2018-01-30 01:49:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:44,714 INFO L93 Difference]: Finished difference Result 35383 states and 44340 transitions. [2018-01-30 01:49:44,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:44,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-01-30 01:49:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:44,751 INFO L225 Difference]: With dead ends: 35383 [2018-01-30 01:49:44,751 INFO L226 Difference]: Without dead ends: 35381 [2018-01-30 01:49:44,757 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35381 states. [2018-01-30 01:49:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35381 to 30003. [2018-01-30 01:49:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30003 states. [2018-01-30 01:49:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30003 states to 30003 states and 37682 transitions. [2018-01-30 01:49:45,103 INFO L78 Accepts]: Start accepts. Automaton has 30003 states and 37682 transitions. Word has length 89 [2018-01-30 01:49:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:45,103 INFO L432 AbstractCegarLoop]: Abstraction has 30003 states and 37682 transitions. [2018-01-30 01:49:45,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30003 states and 37682 transitions. [2018-01-30 01:49:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-30 01:49:45,112 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:45,112 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:45,112 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation]=== [2018-01-30 01:49:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -402242076, now seen corresponding path program 1 times [2018-01-30 01:49:45,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:45,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:45,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:45,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:45,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:45,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:45,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:45,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:45,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:45,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:45,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:45,163 INFO L87 Difference]: Start difference. First operand 30003 states and 37682 transitions. Second operand 3 states. [2018-01-30 01:49:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:45,565 INFO L93 Difference]: Finished difference Result 88375 states and 110900 transitions. [2018-01-30 01:49:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:45,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-01-30 01:49:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:45,615 INFO L225 Difference]: With dead ends: 88375 [2018-01-30 01:49:45,616 INFO L226 Difference]: Without dead ends: 58421 [2018-01-30 01:49:45,642 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58421 states. [2018-01-30 01:49:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58421 to 58419. [2018-01-30 01:49:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58419 states. [2018-01-30 01:49:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58419 states to 58419 states and 72242 transitions. [2018-01-30 01:49:46,232 INFO L78 Accepts]: Start accepts. Automaton has 58419 states and 72242 transitions. Word has length 89 [2018-01-30 01:49:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:46,232 INFO L432 AbstractCegarLoop]: Abstraction has 58419 states and 72242 transitions. [2018-01-30 01:49:46,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 58419 states and 72242 transitions. [2018-01-30 01:49:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-30 01:49:46,247 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:46,247 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:46,247 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation]=== [2018-01-30 01:49:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 415644459, now seen corresponding path program 1 times [2018-01-30 01:49:46,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:46,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:46,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:46,248 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:46,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:46,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:46,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:46,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:46,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:46,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:46,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:46,298 INFO L87 Difference]: Start difference. First operand 58419 states and 72242 transitions. Second operand 3 states. [2018-01-30 01:49:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:47,418 INFO L93 Difference]: Finished difference Result 172087 states and 212532 transitions. [2018-01-30 01:49:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:47,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-01-30 01:49:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:47,479 INFO L225 Difference]: With dead ends: 172087 [2018-01-30 01:49:47,479 INFO L226 Difference]: Without dead ends: 86837 [2018-01-30 01:49:47,523 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86837 states. [2018-01-30 01:49:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86837 to 86835. [2018-01-30 01:49:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86835 states. [2018-01-30 01:49:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86835 states to 86835 states and 104754 transitions. [2018-01-30 01:49:48,329 INFO L78 Accepts]: Start accepts. Automaton has 86835 states and 104754 transitions. Word has length 90 [2018-01-30 01:49:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:48,330 INFO L432 AbstractCegarLoop]: Abstraction has 86835 states and 104754 transitions. [2018-01-30 01:49:48,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 86835 states and 104754 transitions. [2018-01-30 01:49:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-30 01:49:48,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:48,346 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:48,346 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation]=== [2018-01-30 01:49:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1072746799, now seen corresponding path program 1 times [2018-01-30 01:49:48,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:48,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:48,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:48,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:48,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:48,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:48,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:48,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:48,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:48,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:48,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:48,398 INFO L87 Difference]: Start difference. First operand 86835 states and 104754 transitions. Second operand 3 states. [2018-01-30 01:49:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:48,963 INFO L93 Difference]: Finished difference Result 96567 states and 114996 transitions. [2018-01-30 01:49:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:48,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-01-30 01:49:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:49,010 INFO L225 Difference]: With dead ends: 96567 [2018-01-30 01:49:49,010 INFO L226 Difference]: Without dead ends: 68149 [2018-01-30 01:49:49,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68149 states. [2018-01-30 01:49:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68149 to 58419. [2018-01-30 01:49:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58419 states. [2018-01-30 01:49:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58419 states to 58419 states and 69682 transitions. [2018-01-30 01:49:50,516 INFO L78 Accepts]: Start accepts. Automaton has 58419 states and 69682 transitions. Word has length 90 [2018-01-30 01:49:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:50,516 INFO L432 AbstractCegarLoop]: Abstraction has 58419 states and 69682 transitions. [2018-01-30 01:49:50,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 58419 states and 69682 transitions. [2018-01-30 01:49:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-30 01:49:50,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:49:50,526 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:49:50,526 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation]=== [2018-01-30 01:49:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1039725507, now seen corresponding path program 1 times [2018-01-30 01:49:50,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:49:50,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:49:50,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:50,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:49:50,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:49:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:49:50,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:49:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:49:50,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:49:50,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:49:50,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:49:50,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:49:50,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:50,574 INFO L87 Difference]: Start difference. First operand 58419 states and 69682 transitions. Second operand 3 states. [2018-01-30 01:49:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:49:50,754 INFO L93 Difference]: Finished difference Result 58419 states and 69682 transitions. [2018-01-30 01:49:50,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:49:50,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-01-30 01:49:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:49:50,755 INFO L225 Difference]: With dead ends: 58419 [2018-01-30 01:49:50,755 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 01:49:50,787 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:49:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 01:49:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 01:49:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 01:49:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 01:49:50,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-01-30 01:49:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:49:50,788 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 01:49:50,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:49:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 01:49:50,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 01:49:50,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 01:49:50,871 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 178) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(lines 1 178) the Hoare annotation is: true [2018-01-30 01:49:50,872 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 178) the Hoare annotation is: true [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 178) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 178) the Hoare annotation is: true [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 178) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L157'(lines 157 160) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-01-30 01:49:50,872 INFO L399 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L30''(line 30) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L122'(lines 122 125) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L147'(lines 147 150) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 175) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L402 ceAbstractionStarter]: At program point L167'(lines 167 170) the Hoare annotation is: true [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L9'(line 9) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L91'(lines 91 93) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-01-30 01:49:50,873 INFO L399 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L132'(lines 132 135) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L395 ceAbstractionStarter]: At program point L168'(line 168) the Hoare annotation is: false [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L12'(line 12) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L36'(line 36) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L36''(line 36) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L27'(line 27) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L95'(lines 95 97) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-01-30 01:49:50,874 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L103'(lines 103 105) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L127'(lines 127 130) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L111'(lines 111 113) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L83'(lines 83 85) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L137'(lines 137 140) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L99'(lines 99 101) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L75'(lines 75 77) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L87'(lines 87 89) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L162'(lines 162 165) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L402 ceAbstractionStarter]: At program point L173(lines 173 174) the Hoare annotation is: true [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point L9''(line 9) no Hoare annotation was computed. [2018-01-30 01:49:50,875 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L107'(lines 107 109) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L12''(line 12) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L117'(lines 117 120) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L79'(lines 79 81) no Hoare annotation was computed. [2018-01-30 01:49:50,876 INFO L399 ceAbstractionStarter]: For program point L43'(line 43) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L142'(lines 142 145) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L43''(line 43) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L402 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L30'(line 30) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L33''(line 33) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L42(lines 42 172) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L71''(lines 71 73) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L33'(line 33) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L152'(lines 152 155) no Hoare annotation was computed. [2018-01-30 01:49:50,877 INFO L399 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-01-30 01:49:50,878 INFO L399 ceAbstractionStarter]: For program point L6'(line 6) no Hoare annotation was computed. [2018-01-30 01:49:50,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:49:50 BoogieIcfgContainer [2018-01-30 01:49:50,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:49:50,882 INFO L168 Benchmark]: Toolchain (without parser) took 11304.88 ms. Allocated memory was 148.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 114.0 MB in the beginning and 903.1 MB in the end (delta: -789.0 MB). Peak memory consumption was 547.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:49:50,883 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:49:50,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.81 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 104.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:49:50,883 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 148.9 MB. Free memory was 104.2 MB in the beginning and 102.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:49:50,884 INFO L168 Benchmark]: RCFGBuilder took 437.48 ms. Allocated memory is still 148.9 MB. Free memory was 102.6 MB in the beginning and 78.2 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:49:50,884 INFO L168 Benchmark]: TraceAbstraction took 10683.25 ms. Allocated memory was 148.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 78.0 MB in the beginning and 903.1 MB in the end (delta: -825.1 MB). Peak memory consumption was 511.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:49:50,884 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.81 ms. Allocated memory is still 148.9 MB. Free memory was 113.8 MB in the beginning and 104.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 148.9 MB. Free memory was 104.2 MB in the beginning and 102.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 437.48 ms. Allocated memory is still 148.9 MB. Free memory was 102.6 MB in the beginning and 78.2 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10683.25 ms. Allocated memory was 148.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 78.0 MB in the beginning and 903.1 MB in the end (delta: -825.1 MB). Peak memory consumption was 511.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 129 locations, 1 error locations. SAFE Result, 10.6s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4391 SDtfs, 1616 SDslu, 3134 SDs, 0 SdLazy, 109 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86835occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 21629 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2057 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1859 ConstructedInterpolants, 0 QuantifiedInterpolants, 200079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-49-50-888.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-49-50-888.csv Received shutdown request...