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_15_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:51:59,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:51:59,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:51:59,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:51:59,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:51:59,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:51:59,218 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:51:59,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:51:59,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:51:59,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:51:59,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:51:59,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:51:59,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:51:59,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:51:59,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:51:59,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:51:59,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:51:59,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:51:59,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:51:59,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:51:59,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:51:59,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:51:59,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:51:59,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:51:59,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:51:59,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:51:59,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:51:59,231 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:51:59,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:51:59,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:51:59,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:51:59,232 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:51:59,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:51:59,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:51:59,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:51:59,238 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:51:59,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:51:59,238 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:51:59,238 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:51:59,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:51:59,238 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:51:59,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:51:59,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:51:59,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:51:59,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:51:59,240 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:51:59,241 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:51:59,241 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:51:59,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:51:59,266 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:51:59,270 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:51:59,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:51:59,271 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:51:59,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 01:51:59,340 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:51:59,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:51:59,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:51:59,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:51:59,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:51:59,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb949cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59, skipping insertion in model container [2018-01-30 01:51:59,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:51:59,368 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:51:59,444 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:51:59,458 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:51:59,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59 WrapperNode [2018-01-30 01:51:59,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:51:59,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:51:59,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:51:59,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:51:59,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (1/1) ... [2018-01-30 01:51:59,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:51:59,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:51:59,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:51:59,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:51:59,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (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:51:59,524 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:51:59,524 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:51:59,524 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:51:59,524 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:51:59,524 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:51:59,524 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:51:59,524 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:51:59,525 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:52:00,165 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:52:00,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:52:00 BoogieIcfgContainer [2018-01-30 01:52:00,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:52:00,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:52:00,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:52:00,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:52:00,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:51:59" (1/3) ... [2018-01-30 01:52:00,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb38280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:52:00, skipping insertion in model container [2018-01-30 01:52:00,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:51:59" (2/3) ... [2018-01-30 01:52:00,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb38280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:52:00, skipping insertion in model container [2018-01-30 01:52:00,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:52:00" (3/3) ... [2018-01-30 01:52:00,170 INFO L107 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 01:52:00,175 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:52:00,179 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:52:00,213 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:52:00,213 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:52:00,213 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:52:00,213 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:52:00,213 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:52:00,213 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:52:00,213 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:52:00,213 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:52:00,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:52:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-01-30 01:52:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 01:52:00,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:00,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:00,232 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 01:52:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2089243887, now seen corresponding path program 1 times [2018-01-30 01:52:00,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:00,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:00,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:00,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:00,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:00,402 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:52:00,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:00,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:00,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:00,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:00,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:00,414 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2018-01-30 01:52:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:00,502 INFO L93 Difference]: Finished difference Result 372 states and 513 transitions. [2018-01-30 01:52:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:00,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-01-30 01:52:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:00,512 INFO L225 Difference]: With dead ends: 372 [2018-01-30 01:52:00,512 INFO L226 Difference]: Without dead ends: 258 [2018-01-30 01:52:00,514 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:52:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-30 01:52:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-01-30 01:52:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-30 01:52:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 342 transitions. [2018-01-30 01:52:00,608 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 342 transitions. Word has length 104 [2018-01-30 01:52:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:00,609 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 342 transitions. [2018-01-30 01:52:00,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2018-01-30 01:52:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 01:52:00,610 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:00,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:00,611 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 01:52:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -516714393, now seen corresponding path program 1 times [2018-01-30 01:52:00,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:00,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:00,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:00,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:00,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:00,663 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:52:00,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:00,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:00,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:00,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:00,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:00,665 INFO L87 Difference]: Start difference. First operand 256 states and 342 transitions. Second operand 3 states. [2018-01-30 01:52:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:00,715 INFO L93 Difference]: Finished difference Result 309 states and 421 transitions. [2018-01-30 01:52:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:00,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-01-30 01:52:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:00,717 INFO L225 Difference]: With dead ends: 309 [2018-01-30 01:52:00,717 INFO L226 Difference]: Without dead ends: 307 [2018-01-30 01:52:00,718 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:52:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-30 01:52:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 256. [2018-01-30 01:52:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-30 01:52:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 341 transitions. [2018-01-30 01:52:00,726 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 341 transitions. Word has length 105 [2018-01-30 01:52:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:00,726 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 341 transitions. [2018-01-30 01:52:00,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 341 transitions. [2018-01-30 01:52:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 01:52:00,728 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:00,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:00,728 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 01:52:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 342293244, now seen corresponding path program 1 times [2018-01-30 01:52:00,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:00,728 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:00,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:00,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:00,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:00,789 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:52:00,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:00,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:00,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:00,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:00,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:00,790 INFO L87 Difference]: Start difference. First operand 256 states and 341 transitions. Second operand 3 states. [2018-01-30 01:52:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:00,843 INFO L93 Difference]: Finished difference Result 632 states and 885 transitions. [2018-01-30 01:52:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:00,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-01-30 01:52:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:00,845 INFO L225 Difference]: With dead ends: 632 [2018-01-30 01:52:00,845 INFO L226 Difference]: Without dead ends: 441 [2018-01-30 01:52:00,846 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:52:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-01-30 01:52:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2018-01-30 01:52:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-30 01:52:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 604 transitions. [2018-01-30 01:52:00,856 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 604 transitions. Word has length 105 [2018-01-30 01:52:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:00,856 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 604 transitions. [2018-01-30 01:52:00,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 604 transitions. [2018-01-30 01:52:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-30 01:52:00,858 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:00,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:00,858 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 01:52:00,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1157773289, now seen corresponding path program 1 times [2018-01-30 01:52:00,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:00,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:00,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:00,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:00,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:00,914 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:52:00,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:00,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:00,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:00,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:00,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:00,915 INFO L87 Difference]: Start difference. First operand 439 states and 604 transitions. Second operand 3 states. [2018-01-30 01:52:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:00,951 INFO L93 Difference]: Finished difference Result 537 states and 752 transitions. [2018-01-30 01:52:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:00,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-01-30 01:52:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:00,952 INFO L225 Difference]: With dead ends: 537 [2018-01-30 01:52:00,953 INFO L226 Difference]: Without dead ends: 535 [2018-01-30 01:52:00,953 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:52:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-01-30 01:52:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 439. [2018-01-30 01:52:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-30 01:52:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 602 transitions. [2018-01-30 01:52:00,968 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 602 transitions. Word has length 106 [2018-01-30 01:52:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:00,968 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 602 transitions. [2018-01-30 01:52:00,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 602 transitions. [2018-01-30 01:52:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-30 01:52:00,969 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:00,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:00,969 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 01:52:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2021398531, now seen corresponding path program 1 times [2018-01-30 01:52:00,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:00,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:00,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:00,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:00,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,040 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:52:01,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,041 INFO L87 Difference]: Start difference. First operand 439 states and 602 transitions. Second operand 3 states. [2018-01-30 01:52:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,106 INFO L93 Difference]: Finished difference Result 1175 states and 1660 transitions. [2018-01-30 01:52:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-01-30 01:52:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,109 INFO L225 Difference]: With dead ends: 1175 [2018-01-30 01:52:01,109 INFO L226 Difference]: Without dead ends: 801 [2018-01-30 01:52:01,110 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:52:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-01-30 01:52:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2018-01-30 01:52:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-01-30 01:52:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1114 transitions. [2018-01-30 01:52:01,121 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1114 transitions. Word has length 106 [2018-01-30 01:52:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,121 INFO L432 AbstractCegarLoop]: Abstraction has 799 states and 1114 transitions. [2018-01-30 01:52:01,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1114 transitions. [2018-01-30 01:52:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 01:52:01,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,123 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1527284251, now seen corresponding path program 1 times [2018-01-30 01:52:01,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,175 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:52:01,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,176 INFO L87 Difference]: Start difference. First operand 799 states and 1114 transitions. Second operand 3 states. [2018-01-30 01:52:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,221 INFO L93 Difference]: Finished difference Result 983 states and 1392 transitions. [2018-01-30 01:52:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-01-30 01:52:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,223 INFO L225 Difference]: With dead ends: 983 [2018-01-30 01:52:01,223 INFO L226 Difference]: Without dead ends: 981 [2018-01-30 01:52:01,224 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:52:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-01-30 01:52:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 799. [2018-01-30 01:52:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-01-30 01:52:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1110 transitions. [2018-01-30 01:52:01,234 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1110 transitions. Word has length 107 [2018-01-30 01:52:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,234 INFO L432 AbstractCegarLoop]: Abstraction has 799 states and 1110 transitions. [2018-01-30 01:52:01,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1110 transitions. [2018-01-30 01:52:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 01:52:01,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,236 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1760912048, now seen corresponding path program 1 times [2018-01-30 01:52:01,236 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,305 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:52:01,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,307 INFO L87 Difference]: Start difference. First operand 799 states and 1110 transitions. Second operand 3 states. [2018-01-30 01:52:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,384 INFO L93 Difference]: Finished difference Result 2243 states and 3168 transitions. [2018-01-30 01:52:01,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-01-30 01:52:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,388 INFO L225 Difference]: With dead ends: 2243 [2018-01-30 01:52:01,388 INFO L226 Difference]: Without dead ends: 1509 [2018-01-30 01:52:01,389 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:52:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2018-01-30 01:52:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1507. [2018-01-30 01:52:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-01-30 01:52:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2106 transitions. [2018-01-30 01:52:01,405 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2106 transitions. Word has length 107 [2018-01-30 01:52:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,406 INFO L432 AbstractCegarLoop]: Abstraction has 1507 states and 2106 transitions. [2018-01-30 01:52:01,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2106 transitions. [2018-01-30 01:52:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 01:52:01,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,407 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 97222557, now seen corresponding path program 1 times [2018-01-30 01:52:01,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,466 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:52:01,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,467 INFO L87 Difference]: Start difference. First operand 1507 states and 2106 transitions. Second operand 3 states. [2018-01-30 01:52:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,523 INFO L93 Difference]: Finished difference Result 1855 states and 2628 transitions. [2018-01-30 01:52:01,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-01-30 01:52:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,526 INFO L225 Difference]: With dead ends: 1855 [2018-01-30 01:52:01,526 INFO L226 Difference]: Without dead ends: 1853 [2018-01-30 01:52:01,527 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:52:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2018-01-30 01:52:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1507. [2018-01-30 01:52:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-01-30 01:52:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2098 transitions. [2018-01-30 01:52:01,543 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2098 transitions. Word has length 108 [2018-01-30 01:52:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,544 INFO L432 AbstractCegarLoop]: Abstraction has 1507 states and 2098 transitions. [2018-01-30 01:52:01,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2098 transitions. [2018-01-30 01:52:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 01:52:01,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,545 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1246544663, now seen corresponding path program 1 times [2018-01-30 01:52:01,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,601 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:52:01,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,602 INFO L87 Difference]: Start difference. First operand 1507 states and 2098 transitions. Second operand 3 states. [2018-01-30 01:52:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,682 INFO L93 Difference]: Finished difference Result 4343 states and 6100 transitions. [2018-01-30 01:52:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-01-30 01:52:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,688 INFO L225 Difference]: With dead ends: 4343 [2018-01-30 01:52:01,688 INFO L226 Difference]: Without dead ends: 2901 [2018-01-30 01:52:01,690 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:52:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-01-30 01:52:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2899. [2018-01-30 01:52:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-01-30 01:52:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 4034 transitions. [2018-01-30 01:52:01,743 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 4034 transitions. Word has length 108 [2018-01-30 01:52:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,743 INFO L432 AbstractCegarLoop]: Abstraction has 2899 states and 4034 transitions. [2018-01-30 01:52:01,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 4034 transitions. [2018-01-30 01:52:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-30 01:52:01,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,745 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1285016625, now seen corresponding path program 1 times [2018-01-30 01:52:01,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,812 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:52:01,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,813 INFO L87 Difference]: Start difference. First operand 2899 states and 4034 transitions. Second operand 3 states. [2018-01-30 01:52:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:01,884 INFO L93 Difference]: Finished difference Result 3559 states and 5012 transitions. [2018-01-30 01:52:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:01,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-01-30 01:52:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:01,890 INFO L225 Difference]: With dead ends: 3559 [2018-01-30 01:52:01,890 INFO L226 Difference]: Without dead ends: 3557 [2018-01-30 01:52:01,891 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:52:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2018-01-30 01:52:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 2899. [2018-01-30 01:52:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-01-30 01:52:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 4018 transitions. [2018-01-30 01:52:01,923 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 4018 transitions. Word has length 109 [2018-01-30 01:52:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:01,923 INFO L432 AbstractCegarLoop]: Abstraction has 2899 states and 4018 transitions. [2018-01-30 01:52:01,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 4018 transitions. [2018-01-30 01:52:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-30 01:52:01,925 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:01,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:01,925 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 01:52:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -11577436, now seen corresponding path program 1 times [2018-01-30 01:52:01,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:01,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:01,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:01,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:01,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:01,988 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:52:01,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:01,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:01,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:01,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:01,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:01,989 INFO L87 Difference]: Start difference. First operand 2899 states and 4018 transitions. Second operand 3 states. [2018-01-30 01:52:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:02,095 INFO L93 Difference]: Finished difference Result 8471 states and 11796 transitions. [2018-01-30 01:52:02,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:02,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-01-30 01:52:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:02,109 INFO L225 Difference]: With dead ends: 8471 [2018-01-30 01:52:02,109 INFO L226 Difference]: Without dead ends: 5637 [2018-01-30 01:52:02,113 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:52:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2018-01-30 01:52:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5635. [2018-01-30 01:52:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2018-01-30 01:52:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 7778 transitions. [2018-01-30 01:52:02,196 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 7778 transitions. Word has length 109 [2018-01-30 01:52:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:02,197 INFO L432 AbstractCegarLoop]: Abstraction has 5635 states and 7778 transitions. [2018-01-30 01:52:02,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 7778 transitions. [2018-01-30 01:52:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 01:52:02,200 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:02,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:02,200 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 01:52:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1184757935, now seen corresponding path program 1 times [2018-01-30 01:52:02,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:02,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:02,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:02,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:02,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:02,265 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:52:02,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:02,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:02,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:02,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:02,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:02,266 INFO L87 Difference]: Start difference. First operand 5635 states and 7778 transitions. Second operand 3 states. [2018-01-30 01:52:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:02,348 INFO L93 Difference]: Finished difference Result 6887 states and 9604 transitions. [2018-01-30 01:52:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:02,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-01-30 01:52:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:02,364 INFO L225 Difference]: With dead ends: 6887 [2018-01-30 01:52:02,364 INFO L226 Difference]: Without dead ends: 6885 [2018-01-30 01:52:02,366 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:52:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2018-01-30 01:52:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 5635. [2018-01-30 01:52:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2018-01-30 01:52:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 7746 transitions. [2018-01-30 01:52:02,441 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 7746 transitions. Word has length 110 [2018-01-30 01:52:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:02,442 INFO L432 AbstractCegarLoop]: Abstraction has 5635 states and 7746 transitions. [2018-01-30 01:52:02,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 7746 transitions. [2018-01-30 01:52:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 01:52:02,444 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:02,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:02,444 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 01:52:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash -358656469, now seen corresponding path program 1 times [2018-01-30 01:52:02,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:02,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:02,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:02,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:02,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:02,505 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:52:02,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:02,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:02,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:02,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:02,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:02,506 INFO L87 Difference]: Start difference. First operand 5635 states and 7746 transitions. Second operand 3 states. [2018-01-30 01:52:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:02,647 INFO L93 Difference]: Finished difference Result 16583 states and 22852 transitions. [2018-01-30 01:52:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:02,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-01-30 01:52:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:02,667 INFO L225 Difference]: With dead ends: 16583 [2018-01-30 01:52:02,668 INFO L226 Difference]: Without dead ends: 11013 [2018-01-30 01:52:02,674 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:52:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11013 states. [2018-01-30 01:52:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11013 to 11011. [2018-01-30 01:52:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11011 states. [2018-01-30 01:52:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11011 states to 11011 states and 15042 transitions. [2018-01-30 01:52:02,779 INFO L78 Accepts]: Start accepts. Automaton has 11011 states and 15042 transitions. Word has length 110 [2018-01-30 01:52:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:02,779 INFO L432 AbstractCegarLoop]: Abstraction has 11011 states and 15042 transitions. [2018-01-30 01:52:02,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11011 states and 15042 transitions. [2018-01-30 01:52:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 01:52:02,783 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:02,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:02,784 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 01:52:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1766795768, now seen corresponding path program 1 times [2018-01-30 01:52:02,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:02,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:02,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:02,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:02,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:02,845 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:52:02,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:02,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:02,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:02,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:02,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:02,846 INFO L87 Difference]: Start difference. First operand 11011 states and 15042 transitions. Second operand 3 states. [2018-01-30 01:52:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:03,019 INFO L93 Difference]: Finished difference Result 32519 states and 44484 transitions. [2018-01-30 01:52:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:03,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-01-30 01:52:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:03,041 INFO L225 Difference]: With dead ends: 32519 [2018-01-30 01:52:03,041 INFO L226 Difference]: Without dead ends: 21573 [2018-01-30 01:52:03,053 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:52:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21573 states. [2018-01-30 01:52:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21573 to 21571. [2018-01-30 01:52:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21571 states. [2018-01-30 01:52:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21571 states to 21571 states and 29250 transitions. [2018-01-30 01:52:03,308 INFO L78 Accepts]: Start accepts. Automaton has 21571 states and 29250 transitions. Word has length 111 [2018-01-30 01:52:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:03,308 INFO L432 AbstractCegarLoop]: Abstraction has 21571 states and 29250 transitions. [2018-01-30 01:52:03,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21571 states and 29250 transitions. [2018-01-30 01:52:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 01:52:03,315 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:03,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:52:03,315 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-30 01:52:03,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1923261827, now seen corresponding path program 1 times [2018-01-30 01:52:03,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:03,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:03,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:03,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:03,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:03,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:03,369 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:52:03,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:03,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:03,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:03,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:03,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:03,370 INFO L87 Difference]: Start difference. First operand 21571 states and 29250 transitions. Second operand 3 states. [2018-01-30 01:52:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:03,492 INFO L93 Difference]: Finished difference Result 26183 states and 35780 transitions. [2018-01-30 01:52:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:03,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-01-30 01:52:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:03,523 INFO L225 Difference]: With dead ends: 26183 [2018-01-30 01:52:03,523 INFO L226 Difference]: Without dead ends: 26181 [2018-01-30 01:52:03,529 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:52:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26181 states. [2018-01-30 01:52:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26181 to 21571. [2018-01-30 01:52:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21571 states. [2018-01-30 01:52:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21571 states to 21571 states and 29122 transitions. [2018-01-30 01:52:03,787 INFO L78 Accepts]: Start accepts. Automaton has 21571 states and 29122 transitions. Word has length 111 [2018-01-30 01:52:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:03,787 INFO L432 AbstractCegarLoop]: Abstraction has 21571 states and 29122 transitions. [2018-01-30 01:52:03,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21571 states and 29122 transitions. [2018-01-30 01:52:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-30 01:52:03,795 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:03,795 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, 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:52:03,796 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation]=== [2018-01-30 01:52:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash -512372987, now seen corresponding path program 1 times [2018-01-30 01:52:03,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:03,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:03,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:03,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:03,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:03,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:03,856 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:52:03,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:03,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:03,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:03,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:03,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:03,856 INFO L87 Difference]: Start difference. First operand 21571 states and 29122 transitions. Second operand 3 states. [2018-01-30 01:52:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:03,972 INFO L93 Difference]: Finished difference Result 26055 states and 35396 transitions. [2018-01-30 01:52:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:03,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-01-30 01:52:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:03,995 INFO L225 Difference]: With dead ends: 26055 [2018-01-30 01:52:03,995 INFO L226 Difference]: Without dead ends: 26053 [2018-01-30 01:52:04,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:52:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2018-01-30 01:52:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 21571. [2018-01-30 01:52:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21571 states. [2018-01-30 01:52:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21571 states to 21571 states and 28994 transitions. [2018-01-30 01:52:04,572 INFO L78 Accepts]: Start accepts. Automaton has 21571 states and 28994 transitions. Word has length 112 [2018-01-30 01:52:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:04,572 INFO L432 AbstractCegarLoop]: Abstraction has 21571 states and 28994 transitions. [2018-01-30 01:52:04,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21571 states and 28994 transitions. [2018-01-30 01:52:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-30 01:52:04,580 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:04,580 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, 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:52:04,580 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation]=== [2018-01-30 01:52:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1063661249, now seen corresponding path program 1 times [2018-01-30 01:52:04,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:04,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:04,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:04,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:04,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:04,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:04,644 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:52:04,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:04,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:04,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:04,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:04,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:04,646 INFO L87 Difference]: Start difference. First operand 21571 states and 28994 transitions. Second operand 3 states. [2018-01-30 01:52:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:04,845 INFO L93 Difference]: Finished difference Result 63815 states and 85828 transitions. [2018-01-30 01:52:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:04,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-01-30 01:52:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:04,878 INFO L225 Difference]: With dead ends: 63815 [2018-01-30 01:52:04,878 INFO L226 Difference]: Without dead ends: 42309 [2018-01-30 01:52:04,903 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:52:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42309 states. [2018-01-30 01:52:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42309 to 42307. [2018-01-30 01:52:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42307 states. [2018-01-30 01:52:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42307 states to 42307 states and 56386 transitions. [2018-01-30 01:52:05,307 INFO L78 Accepts]: Start accepts. Automaton has 42307 states and 56386 transitions. Word has length 112 [2018-01-30 01:52:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:05,307 INFO L432 AbstractCegarLoop]: Abstraction has 42307 states and 56386 transitions. [2018-01-30 01:52:05,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 42307 states and 56386 transitions. [2018-01-30 01:52:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-30 01:52:05,318 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:05,318 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, 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:52:05,318 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation]=== [2018-01-30 01:52:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1292359479, now seen corresponding path program 1 times [2018-01-30 01:52:05,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:05,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:05,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:05,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:05,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:05,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:05,382 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:52:05,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:05,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:05,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:05,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:05,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:05,383 INFO L87 Difference]: Start difference. First operand 42307 states and 56386 transitions. Second operand 3 states. [2018-01-30 01:52:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:05,670 INFO L93 Difference]: Finished difference Result 50759 states and 67908 transitions. [2018-01-30 01:52:05,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:05,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-01-30 01:52:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:05,703 INFO L225 Difference]: With dead ends: 50759 [2018-01-30 01:52:05,704 INFO L226 Difference]: Without dead ends: 50757 [2018-01-30 01:52:05,711 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:52:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50757 states. [2018-01-30 01:52:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50757 to 42307. [2018-01-30 01:52:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42307 states. [2018-01-30 01:52:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42307 states to 42307 states and 56130 transitions. [2018-01-30 01:52:06,218 INFO L78 Accepts]: Start accepts. Automaton has 42307 states and 56130 transitions. Word has length 113 [2018-01-30 01:52:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:06,218 INFO L432 AbstractCegarLoop]: Abstraction has 42307 states and 56130 transitions. [2018-01-30 01:52:06,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 42307 states and 56130 transitions. [2018-01-30 01:52:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-30 01:52:06,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:06,229 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, 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:52:06,229 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation]=== [2018-01-30 01:52:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1386484812, now seen corresponding path program 1 times [2018-01-30 01:52:06,229 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:06,229 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:06,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:06,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:06,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:06,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:06,280 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:52:06,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:06,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:06,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:06,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:06,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:06,280 INFO L87 Difference]: Start difference. First operand 42307 states and 56130 transitions. Second operand 3 states. [2018-01-30 01:52:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:06,593 INFO L93 Difference]: Finished difference Result 125255 states and 166212 transitions. [2018-01-30 01:52:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:06,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-01-30 01:52:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:06,651 INFO L225 Difference]: With dead ends: 125255 [2018-01-30 01:52:06,651 INFO L226 Difference]: Without dead ends: 83013 [2018-01-30 01:52:06,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:52:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83013 states. [2018-01-30 01:52:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83013 to 83011. [2018-01-30 01:52:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83011 states. [2018-01-30 01:52:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83011 states to 83011 states and 109122 transitions. [2018-01-30 01:52:08,124 INFO L78 Accepts]: Start accepts. Automaton has 83011 states and 109122 transitions. Word has length 113 [2018-01-30 01:52:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:08,124 INFO L432 AbstractCegarLoop]: Abstraction has 83011 states and 109122 transitions. [2018-01-30 01:52:08,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 83011 states and 109122 transitions. [2018-01-30 01:52:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-30 01:52:08,140 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:08,141 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, 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:52:08,141 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation]=== [2018-01-30 01:52:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1404491449, now seen corresponding path program 1 times [2018-01-30 01:52:08,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:08,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:08,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:08,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:08,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:08,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:08,199 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:52:08,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:08,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:08,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:08,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:08,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:08,199 INFO L87 Difference]: Start difference. First operand 83011 states and 109122 transitions. Second operand 3 states. [2018-01-30 01:52:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:08,664 INFO L93 Difference]: Finished difference Result 98887 states and 130116 transitions. [2018-01-30 01:52:08,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:08,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-01-30 01:52:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:08,739 INFO L225 Difference]: With dead ends: 98887 [2018-01-30 01:52:08,739 INFO L226 Difference]: Without dead ends: 98885 [2018-01-30 01:52:08,756 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:52:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98885 states. [2018-01-30 01:52:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98885 to 83011. [2018-01-30 01:52:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83011 states. [2018-01-30 01:52:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83011 states to 83011 states and 108610 transitions. [2018-01-30 01:52:10,326 INFO L78 Accepts]: Start accepts. Automaton has 83011 states and 108610 transitions. Word has length 114 [2018-01-30 01:52:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:10,327 INFO L432 AbstractCegarLoop]: Abstraction has 83011 states and 108610 transitions. [2018-01-30 01:52:10,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 83011 states and 108610 transitions. [2018-01-30 01:52:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-30 01:52:10,344 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:10,344 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, 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:52:10,344 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation]=== [2018-01-30 01:52:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 31601747, now seen corresponding path program 1 times [2018-01-30 01:52:10,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:10,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:10,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:10,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:10,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:10,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:10,383 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:52:10,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:10,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:10,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:10,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:10,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:10,384 INFO L87 Difference]: Start difference. First operand 83011 states and 108610 transitions. Second operand 3 states. [2018-01-30 01:52:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:11,205 INFO L93 Difference]: Finished difference Result 245831 states and 321604 transitions. [2018-01-30 01:52:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:11,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-01-30 01:52:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:11,303 INFO L225 Difference]: With dead ends: 245831 [2018-01-30 01:52:11,303 INFO L226 Difference]: Without dead ends: 162885 [2018-01-30 01:52:11,340 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:52:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162885 states. [2018-01-30 01:52:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162885 to 162883. [2018-01-30 01:52:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162883 states. [2018-01-30 01:52:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162883 states to 162883 states and 211010 transitions. [2018-01-30 01:52:13,984 INFO L78 Accepts]: Start accepts. Automaton has 162883 states and 211010 transitions. Word has length 114 [2018-01-30 01:52:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:13,985 INFO L432 AbstractCegarLoop]: Abstraction has 162883 states and 211010 transitions. [2018-01-30 01:52:13,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 162883 states and 211010 transitions. [2018-01-30 01:52:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-30 01:52:14,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:14,014 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, 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:52:14,014 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation]=== [2018-01-30 01:52:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 585615595, now seen corresponding path program 1 times [2018-01-30 01:52:14,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:14,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:14,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:14,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:14,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:14,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:14,063 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:52:14,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:14,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:14,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:14,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:14,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:14,064 INFO L87 Difference]: Start difference. First operand 162883 states and 211010 transitions. Second operand 3 states. [2018-01-30 01:52:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:14,958 INFO L93 Difference]: Finished difference Result 192583 states and 248900 transitions. [2018-01-30 01:52:14,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:14,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-01-30 01:52:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:15,098 INFO L225 Difference]: With dead ends: 192583 [2018-01-30 01:52:15,099 INFO L226 Difference]: Without dead ends: 192581 [2018-01-30 01:52:15,130 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:52:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192581 states. [2018-01-30 01:52:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192581 to 162883. [2018-01-30 01:52:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162883 states. [2018-01-30 01:52:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162883 states to 162883 states and 209986 transitions. [2018-01-30 01:52:18,209 INFO L78 Accepts]: Start accepts. Automaton has 162883 states and 209986 transitions. Word has length 115 [2018-01-30 01:52:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:18,210 INFO L432 AbstractCegarLoop]: Abstraction has 162883 states and 209986 transitions. [2018-01-30 01:52:18,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 162883 states and 209986 transitions. [2018-01-30 01:52:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-30 01:52:18,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:18,527 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, 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:52:18,528 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation]=== [2018-01-30 01:52:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 979900064, now seen corresponding path program 1 times [2018-01-30 01:52:18,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:18,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:18,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:18,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:18,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:18,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:18,576 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:52:18,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:18,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:18,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:18,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:18,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:18,576 INFO L87 Difference]: Start difference. First operand 162883 states and 209986 transitions. Second operand 3 states. [2018-01-30 01:52:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:19,800 INFO L93 Difference]: Finished difference Result 482375 states and 621636 transitions. [2018-01-30 01:52:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:19,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-01-30 01:52:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:20,057 INFO L225 Difference]: With dead ends: 482375 [2018-01-30 01:52:20,057 INFO L226 Difference]: Without dead ends: 319557 [2018-01-30 01:52:20,169 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:52:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319557 states. [2018-01-30 01:52:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319557 to 319555. [2018-01-30 01:52:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319555 states. [2018-01-30 01:52:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319555 states to 319555 states and 407618 transitions. [2018-01-30 01:52:25,790 INFO L78 Accepts]: Start accepts. Automaton has 319555 states and 407618 transitions. Word has length 115 [2018-01-30 01:52:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:25,790 INFO L432 AbstractCegarLoop]: Abstraction has 319555 states and 407618 transitions. [2018-01-30 01:52:25,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 319555 states and 407618 transitions. [2018-01-30 01:52:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-30 01:52:25,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:25,848 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, 1, 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:52:25,849 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation]=== [2018-01-30 01:52:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash 970268269, now seen corresponding path program 1 times [2018-01-30 01:52:25,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:25,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:25,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:25,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:25,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:25,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:25,913 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:52:25,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:25,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:25,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:25,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:25,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:25,914 INFO L87 Difference]: Start difference. First operand 319555 states and 407618 transitions. Second operand 3 states. [2018-01-30 01:52:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:27,805 INFO L93 Difference]: Finished difference Result 374855 states and 475204 transitions. [2018-01-30 01:52:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:27,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-01-30 01:52:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:28,078 INFO L225 Difference]: With dead ends: 374855 [2018-01-30 01:52:28,078 INFO L226 Difference]: Without dead ends: 374853 [2018-01-30 01:52:28,131 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:52:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374853 states. [2018-01-30 01:52:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374853 to 319555. [2018-01-30 01:52:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319555 states. [2018-01-30 01:52:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319555 states to 319555 states and 405570 transitions. [2018-01-30 01:52:34,623 INFO L78 Accepts]: Start accepts. Automaton has 319555 states and 405570 transitions. Word has length 116 [2018-01-30 01:52:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:34,623 INFO L432 AbstractCegarLoop]: Abstraction has 319555 states and 405570 transitions. [2018-01-30 01:52:34,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 319555 states and 405570 transitions. [2018-01-30 01:52:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-30 01:52:34,684 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:52:34,684 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, 1, 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:52:34,684 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation]=== [2018-01-30 01:52:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash 312377191, now seen corresponding path program 1 times [2018-01-30 01:52:34,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:52:34,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:52:34,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:34,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:52:34,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:52:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:52:34,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:52:34,741 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:52:34,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:52:34,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:52:34,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:52:34,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:52:34,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:52:34,742 INFO L87 Difference]: Start difference. First operand 319555 states and 405570 transitions. Second operand 3 states. [2018-01-30 01:52:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:52:41,924 INFO L93 Difference]: Finished difference Result 946247 states and 1200196 transitions. [2018-01-30 01:52:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:52:41,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-01-30 01:52:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:52:42,456 INFO L225 Difference]: With dead ends: 946247 [2018-01-30 01:52:42,456 INFO L226 Difference]: Without dead ends: 626757 [2018-01-30 01:52:42,621 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:52:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626757 states. [2018-01-30 01:52:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626757 to 626755. [2018-01-30 01:52:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626755 states. [2018-01-30 01:52:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626755 states to 626755 states and 786498 transitions. [2018-01-30 01:52:53,593 INFO L78 Accepts]: Start accepts. Automaton has 626755 states and 786498 transitions. Word has length 116 [2018-01-30 01:52:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:52:53,593 INFO L432 AbstractCegarLoop]: Abstraction has 626755 states and 786498 transitions. [2018-01-30 01:52:53,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:52:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 626755 states and 786498 transitions. Received shutdown request... [2018-01-30 01:52:57,408 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:52:57,411 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:52:57,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:52:57 BoogieIcfgContainer [2018-01-30 01:52:57,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:52:57,411 INFO L168 Benchmark]: Toolchain (without parser) took 58070.81 ms. Allocated memory was 150.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 115.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 5.3 GB. [2018-01-30 01:52:57,412 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 150.5 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:52:57,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 120.47 ms. Allocated memory is still 150.5 MB. Free memory was 115.3 MB in the beginning and 105.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:52:57,413 INFO L168 Benchmark]: Boogie Preprocessor took 19.69 ms. Allocated memory is still 150.5 MB. Free memory was 105.1 MB in the beginning and 103.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:52:57,413 INFO L168 Benchmark]: RCFGBuilder took 683.24 ms. Allocated memory is still 150.5 MB. Free memory was 103.4 MB in the beginning and 73.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:52:57,413 INFO L168 Benchmark]: TraceAbstraction took 57245.09 ms. Allocated memory was 150.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 73.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 5.3 GB. [2018-01-30 01:52:57,414 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 150.5 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 120.47 ms. Allocated memory is still 150.5 MB. Free memory was 115.3 MB in the beginning and 105.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.69 ms. Allocated memory is still 150.5 MB. Free memory was 105.1 MB in the beginning and 103.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 683.24 ms. Allocated memory is still 150.5 MB. Free memory was 103.4 MB in the beginning and 73.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57245.09 ms. Allocated memory was 150.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 73.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 231]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 231). Cancelled while IsEmpty was searching accepting run (input had 626755 states). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 169 locations, 1 error locations. TIMEOUT Result, 57.2s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6780 SDtfs, 2587 SDslu, 4891 SDs, 0 SdLazy, 125 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626755occurred in iteration=25, 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: 34.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 121021 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2756 NumberOfCodeBlocks, 2756 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2731 ConstructedInterpolants, 0 QuantifiedInterpolants, 383219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_15_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-52-57-417.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_15_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-52-57-417.csv Completed graceful shutdown