/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:22,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:22,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:22,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:22,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:22,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:22,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:22,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:22,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:22,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:22,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:22,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:22,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:22,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:22,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:22,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:22,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:22,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:22,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:22,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:22,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:22,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:22,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:22,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:22,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:22,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:22,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:22,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:22,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:22,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:22,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:22,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:22,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:22,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:22,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:22,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:22,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:22,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:22,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:22,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:22,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:22,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:24:22,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:22,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:22,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:22,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:22,624 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:22,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:22,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:22,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:22,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:22,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:22,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:22,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:22,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:22,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:22,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:22,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:22,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:22,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:22,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:22,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:22,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:22,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:22,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:22,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:22,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:22,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:22,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:22,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:22,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:22,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-11-06 22:24:23,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b7e638e/c1e2af20a243468fa29cd91fe125d508/FLAG7e9819f33 [2019-11-06 22:24:23,430 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:23,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-11-06 22:24:23,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b7e638e/c1e2af20a243468fa29cd91fe125d508/FLAG7e9819f33 [2019-11-06 22:24:23,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b7e638e/c1e2af20a243468fa29cd91fe125d508 [2019-11-06 22:24:23,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:23,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:23,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:23,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:23,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:23,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:23" (1/1) ... [2019-11-06 22:24:23,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3ba52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:23, skipping insertion in model container [2019-11-06 22:24:23,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:23" (1/1) ... [2019-11-06 22:24:23,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:24,034 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:24,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:24,339 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:24,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:24,517 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:24,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24 WrapperNode [2019-11-06 22:24:24,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:24,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:24,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:24,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:24,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... [2019-11-06 22:24:24,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:24,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:24,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:24,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:24,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-11-06 22:24:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-11-06 22:24:24,637 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:24,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:24,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:25,342 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:25,342 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 22:24:25,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:25 BoogieIcfgContainer [2019-11-06 22:24:25,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:25,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:25,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:25,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:25,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:23" (1/3) ... [2019-11-06 22:24:25,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7eb7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:25, skipping insertion in model container [2019-11-06 22:24:25,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:24" (2/3) ... [2019-11-06 22:24:25,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7eb7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:25, skipping insertion in model container [2019-11-06 22:24:25,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:25" (3/3) ... [2019-11-06 22:24:25,359 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-11-06 22:24:25,369 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:25,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:25,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:25,428 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:25,429 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:25,429 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:25,429 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:25,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:25,430 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:25,430 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:25,430 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-11-06 22:24:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:25,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:25,479 INFO L410 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] [2019-11-06 22:24:25,481 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -854031758, now seen corresponding path program 1 times [2019-11-06 22:24:25,494 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:25,494 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189503374] [2019-11-06 22:24:25,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,927 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-06 22:24:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:25,974 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189503374] [2019-11-06 22:24:25,975 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:25,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:25,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295438279] [2019-11-06 22:24:25,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:25,983 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:26,000 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-11-06 22:24:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:26,879 INFO L93 Difference]: Finished difference Result 332 states and 575 transitions. [2019-11-06 22:24:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:26,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:26,896 INFO L225 Difference]: With dead ends: 332 [2019-11-06 22:24:26,897 INFO L226 Difference]: Without dead ends: 178 [2019-11-06 22:24:26,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-06 22:24:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2019-11-06 22:24:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-06 22:24:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 245 transitions. [2019-11-06 22:24:27,015 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 245 transitions. Word has length 47 [2019-11-06 22:24:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:27,016 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 245 transitions. [2019-11-06 22:24:27,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2019-11-06 22:24:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:27,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:27,029 INFO L410 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] [2019-11-06 22:24:27,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -459664972, now seen corresponding path program 1 times [2019-11-06 22:24:27,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:27,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545362871] [2019-11-06 22:24:27,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:27,233 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545362871] [2019-11-06 22:24:27,233 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:27,233 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:27,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911637198] [2019-11-06 22:24:27,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:27,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:27,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:27,238 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 4 states. [2019-11-06 22:24:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:27,954 INFO L93 Difference]: Finished difference Result 314 states and 511 transitions. [2019-11-06 22:24:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:27,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:27,958 INFO L225 Difference]: With dead ends: 314 [2019-11-06 22:24:27,958 INFO L226 Difference]: Without dead ends: 178 [2019-11-06 22:24:27,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-06 22:24:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2019-11-06 22:24:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-06 22:24:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 244 transitions. [2019-11-06 22:24:27,981 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 244 transitions. Word has length 47 [2019-11-06 22:24:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:27,981 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 244 transitions. [2019-11-06 22:24:27,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 244 transitions. [2019-11-06 22:24:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:27,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:27,984 INFO L410 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] [2019-11-06 22:24:27,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1591319026, now seen corresponding path program 1 times [2019-11-06 22:24:27,985 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:27,985 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632698214] [2019-11-06 22:24:27,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:28,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632698214] [2019-11-06 22:24:28,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:28,198 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:28,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695013745] [2019-11-06 22:24:28,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:28,199 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:28,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:28,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:28,200 INFO L87 Difference]: Start difference. First operand 152 states and 244 transitions. Second operand 5 states. [2019-11-06 22:24:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:29,444 INFO L93 Difference]: Finished difference Result 473 states and 771 transitions. [2019-11-06 22:24:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:24:29,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:29,452 INFO L225 Difference]: With dead ends: 473 [2019-11-06 22:24:29,452 INFO L226 Difference]: Without dead ends: 338 [2019-11-06 22:24:29,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-06 22:24:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2019-11-06 22:24:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-06 22:24:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2019-11-06 22:24:29,526 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 47 [2019-11-06 22:24:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:29,526 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2019-11-06 22:24:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2019-11-06 22:24:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:29,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:29,536 INFO L410 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] [2019-11-06 22:24:29,537 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1541564722, now seen corresponding path program 1 times [2019-11-06 22:24:29,538 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:29,540 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655667078] [2019-11-06 22:24:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,747 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-06 22:24:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:29,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655667078] [2019-11-06 22:24:29,774 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:29,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:29,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139625595] [2019-11-06 22:24:29,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:29,775 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:29,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:29,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:29,776 INFO L87 Difference]: Start difference. First operand 297 states and 484 transitions. Second operand 5 states. [2019-11-06 22:24:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:31,042 INFO L93 Difference]: Finished difference Result 842 states and 1381 transitions. [2019-11-06 22:24:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:31,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:31,047 INFO L225 Difference]: With dead ends: 842 [2019-11-06 22:24:31,047 INFO L226 Difference]: Without dead ends: 571 [2019-11-06 22:24:31,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-06 22:24:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 508. [2019-11-06 22:24:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-06 22:24:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 829 transitions. [2019-11-06 22:24:31,099 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 829 transitions. Word has length 47 [2019-11-06 22:24:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:31,099 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 829 transitions. [2019-11-06 22:24:31,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 829 transitions. [2019-11-06 22:24:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:31,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:31,102 INFO L410 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] [2019-11-06 22:24:31,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1816324336, now seen corresponding path program 1 times [2019-11-06 22:24:31,103 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:31,103 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878519064] [2019-11-06 22:24:31,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:31,227 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878519064] [2019-11-06 22:24:31,228 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:31,228 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:31,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571990554] [2019-11-06 22:24:31,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:31,229 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:31,230 INFO L87 Difference]: Start difference. First operand 508 states and 829 transitions. Second operand 5 states. [2019-11-06 22:24:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:32,651 INFO L93 Difference]: Finished difference Result 1511 states and 2482 transitions. [2019-11-06 22:24:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:32,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:32,659 INFO L225 Difference]: With dead ends: 1511 [2019-11-06 22:24:32,659 INFO L226 Difference]: Without dead ends: 1031 [2019-11-06 22:24:32,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-11-06 22:24:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 944. [2019-11-06 22:24:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-11-06 22:24:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1555 transitions. [2019-11-06 22:24:32,744 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1555 transitions. Word has length 47 [2019-11-06 22:24:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1555 transitions. [2019-11-06 22:24:32,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1555 transitions. [2019-11-06 22:24:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:32,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:32,749 INFO L410 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] [2019-11-06 22:24:32,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1777043086, now seen corresponding path program 1 times [2019-11-06 22:24:32,750 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:32,750 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122344627] [2019-11-06 22:24:32,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:32,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122344627] [2019-11-06 22:24:32,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:32,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:32,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246687678] [2019-11-06 22:24:32,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:32,887 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:32,888 INFO L87 Difference]: Start difference. First operand 944 states and 1555 transitions. Second operand 4 states. [2019-11-06 22:24:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:33,920 INFO L93 Difference]: Finished difference Result 2498 states and 4057 transitions. [2019-11-06 22:24:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:33,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:33,931 INFO L225 Difference]: With dead ends: 2498 [2019-11-06 22:24:33,931 INFO L226 Difference]: Without dead ends: 1586 [2019-11-06 22:24:33,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-06 22:24:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1473. [2019-11-06 22:24:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-06 22:24:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2390 transitions. [2019-11-06 22:24:34,061 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2390 transitions. Word has length 47 [2019-11-06 22:24:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:34,062 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2390 transitions. [2019-11-06 22:24:34,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2390 transitions. [2019-11-06 22:24:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:34,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:34,065 INFO L410 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] [2019-11-06 22:24:34,066 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash -390839692, now seen corresponding path program 1 times [2019-11-06 22:24:34,066 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:34,067 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768935260] [2019-11-06 22:24:34,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:34,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768935260] [2019-11-06 22:24:34,181 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:34,182 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:34,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985658830] [2019-11-06 22:24:34,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:34,182 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:34,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:34,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:34,183 INFO L87 Difference]: Start difference. First operand 1473 states and 2390 transitions. Second operand 4 states. [2019-11-06 22:24:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:35,003 INFO L93 Difference]: Finished difference Result 3083 states and 5004 transitions. [2019-11-06 22:24:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:35,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:35,017 INFO L225 Difference]: With dead ends: 3083 [2019-11-06 22:24:35,017 INFO L226 Difference]: Without dead ends: 1664 [2019-11-06 22:24:35,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-06 22:24:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1563. [2019-11-06 22:24:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-06 22:24:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2539 transitions. [2019-11-06 22:24:35,179 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2539 transitions. Word has length 47 [2019-11-06 22:24:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:35,180 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2539 transitions. [2019-11-06 22:24:35,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2539 transitions. [2019-11-06 22:24:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:35,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:35,184 INFO L410 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] [2019-11-06 22:24:35,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 409745528, now seen corresponding path program 1 times [2019-11-06 22:24:35,185 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:35,186 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008238545] [2019-11-06 22:24:35,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:35,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008238545] [2019-11-06 22:24:35,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:35,362 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:35,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313342307] [2019-11-06 22:24:35,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:35,363 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:35,364 INFO L87 Difference]: Start difference. First operand 1563 states and 2539 transitions. Second operand 5 states. [2019-11-06 22:24:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:36,507 INFO L93 Difference]: Finished difference Result 3404 states and 5489 transitions. [2019-11-06 22:24:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:24:36,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:36,519 INFO L225 Difference]: With dead ends: 3404 [2019-11-06 22:24:36,520 INFO L226 Difference]: Without dead ends: 1886 [2019-11-06 22:24:36,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-11-06 22:24:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1749. [2019-11-06 22:24:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-11-06 22:24:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2806 transitions. [2019-11-06 22:24:36,674 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2806 transitions. Word has length 47 [2019-11-06 22:24:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:36,676 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2806 transitions. [2019-11-06 22:24:36,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2806 transitions. [2019-11-06 22:24:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:36,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:36,680 INFO L410 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] [2019-11-06 22:24:36,680 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 628600246, now seen corresponding path program 1 times [2019-11-06 22:24:36,681 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:36,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509044889] [2019-11-06 22:24:36,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:36,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509044889] [2019-11-06 22:24:36,847 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:36,848 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:36,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826468744] [2019-11-06 22:24:36,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:36,849 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:36,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:36,850 INFO L87 Difference]: Start difference. First operand 1749 states and 2806 transitions. Second operand 5 states. [2019-11-06 22:24:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:37,944 INFO L93 Difference]: Finished difference Result 3592 states and 5770 transitions. [2019-11-06 22:24:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:24:37,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:37,957 INFO L225 Difference]: With dead ends: 3592 [2019-11-06 22:24:37,958 INFO L226 Difference]: Without dead ends: 1894 [2019-11-06 22:24:37,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-06 22:24:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1749. [2019-11-06 22:24:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-11-06 22:24:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2756 transitions. [2019-11-06 22:24:38,155 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2756 transitions. Word has length 47 [2019-11-06 22:24:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:38,155 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2756 transitions. [2019-11-06 22:24:38,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2756 transitions. [2019-11-06 22:24:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:38,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:38,157 INFO L410 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] [2019-11-06 22:24:38,159 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1051302072, now seen corresponding path program 1 times [2019-11-06 22:24:38,160 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:38,163 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20858333] [2019-11-06 22:24:38,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:38,293 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20858333] [2019-11-06 22:24:38,293 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:38,293 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:24:38,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585438570] [2019-11-06 22:24:38,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:24:38,295 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:24:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:38,300 INFO L87 Difference]: Start difference. First operand 1749 states and 2756 transitions. Second operand 5 states. [2019-11-06 22:24:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:39,376 INFO L93 Difference]: Finished difference Result 3969 states and 6221 transitions. [2019-11-06 22:24:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:24:39,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-06 22:24:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:39,388 INFO L225 Difference]: With dead ends: 3969 [2019-11-06 22:24:39,389 INFO L226 Difference]: Without dead ends: 2283 [2019-11-06 22:24:39,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-11-06 22:24:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2138. [2019-11-06 22:24:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-06 22:24:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3345 transitions. [2019-11-06 22:24:39,597 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3345 transitions. Word has length 47 [2019-11-06 22:24:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:39,597 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3345 transitions. [2019-11-06 22:24:39,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:24:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3345 transitions. [2019-11-06 22:24:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:39,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:39,599 INFO L410 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] [2019-11-06 22:24:39,599 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:39,599 INFO L82 PathProgramCache]: Analyzing trace with hash 233653622, now seen corresponding path program 1 times [2019-11-06 22:24:39,600 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:39,600 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667926983] [2019-11-06 22:24:39,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:39,746 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667926983] [2019-11-06 22:24:39,746 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:39,747 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:39,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665608482] [2019-11-06 22:24:39,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:39,747 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:39,748 INFO L87 Difference]: Start difference. First operand 2138 states and 3345 transitions. Second operand 4 states. [2019-11-06 22:24:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:40,479 INFO L93 Difference]: Finished difference Result 4588 states and 7177 transitions. [2019-11-06 22:24:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:40,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:40,495 INFO L225 Difference]: With dead ends: 4588 [2019-11-06 22:24:40,495 INFO L226 Difference]: Without dead ends: 2495 [2019-11-06 22:24:40,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-11-06 22:24:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2374. [2019-11-06 22:24:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-11-06 22:24:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3644 transitions. [2019-11-06 22:24:40,686 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3644 transitions. Word has length 47 [2019-11-06 22:24:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:40,686 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3644 transitions. [2019-11-06 22:24:40,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3644 transitions. [2019-11-06 22:24:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 22:24:40,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:40,688 INFO L410 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] [2019-11-06 22:24:40,688 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1760491084, now seen corresponding path program 1 times [2019-11-06 22:24:40,689 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:40,689 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112678380] [2019-11-06 22:24:40,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:40,811 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112678380] [2019-11-06 22:24:40,811 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:40,811 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:24:40,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127410414] [2019-11-06 22:24:40,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:24:40,812 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:24:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:24:40,812 INFO L87 Difference]: Start difference. First operand 2374 states and 3644 transitions. Second operand 4 states. [2019-11-06 22:24:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:41,745 INFO L93 Difference]: Finished difference Result 5658 states and 8838 transitions. [2019-11-06 22:24:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:24:41,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 22:24:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:41,768 INFO L225 Difference]: With dead ends: 5658 [2019-11-06 22:24:41,768 INFO L226 Difference]: Without dead ends: 3326 [2019-11-06 22:24:41,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:24:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-11-06 22:24:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3083. [2019-11-06 22:24:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3083 states. [2019-11-06 22:24:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4746 transitions. [2019-11-06 22:24:42,023 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4746 transitions. Word has length 47 [2019-11-06 22:24:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:42,024 INFO L462 AbstractCegarLoop]: Abstraction has 3083 states and 4746 transitions. [2019-11-06 22:24:42,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:24:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4746 transitions. [2019-11-06 22:24:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-06 22:24:42,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:42,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:42,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1060036737, now seen corresponding path program 1 times [2019-11-06 22:24:42,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:42,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413951778] [2019-11-06 22:24:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:42,175 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413951778] [2019-11-06 22:24:42,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:42,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:24:42,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793372660] [2019-11-06 22:24:42,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:24:42,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:24:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:42,180 INFO L87 Difference]: Start difference. First operand 3083 states and 4746 transitions. Second operand 7 states. [2019-11-06 22:24:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:44,453 INFO L93 Difference]: Finished difference Result 10092 states and 16465 transitions. [2019-11-06 22:24:44,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:24:44,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-06 22:24:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:44,492 INFO L225 Difference]: With dead ends: 10092 [2019-11-06 22:24:44,492 INFO L226 Difference]: Without dead ends: 7045 [2019-11-06 22:24:44,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:24:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states. [2019-11-06 22:24:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 5734. [2019-11-06 22:24:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-11-06 22:24:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 9114 transitions. [2019-11-06 22:24:44,970 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 9114 transitions. Word has length 67 [2019-11-06 22:24:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:44,970 INFO L462 AbstractCegarLoop]: Abstraction has 5734 states and 9114 transitions. [2019-11-06 22:24:44,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:24:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 9114 transitions. [2019-11-06 22:24:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-06 22:24:44,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:44,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:44,978 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:44,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1168897503, now seen corresponding path program 1 times [2019-11-06 22:24:44,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:44,979 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403297762] [2019-11-06 22:24:44,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:24:45,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403297762] [2019-11-06 22:24:45,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71259820] [2019-11-06 22:24:45,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:24:45,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 22:24:45,341 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:45,341 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-11-06 22:24:45,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318675277] [2019-11-06 22:24:45,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:45,342 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:45,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:45,343 INFO L87 Difference]: Start difference. First operand 5734 states and 9114 transitions. Second operand 3 states. [2019-11-06 22:24:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:46,199 INFO L93 Difference]: Finished difference Result 12876 states and 20843 transitions. [2019-11-06 22:24:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:46,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-06 22:24:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:46,239 INFO L225 Difference]: With dead ends: 12876 [2019-11-06 22:24:46,240 INFO L226 Difference]: Without dead ends: 4255 [2019-11-06 22:24:46,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-11-06 22:24:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4229. [2019-11-06 22:24:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4229 states. [2019-11-06 22:24:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 6538 transitions. [2019-11-06 22:24:46,795 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 6538 transitions. Word has length 81 [2019-11-06 22:24:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:46,796 INFO L462 AbstractCegarLoop]: Abstraction has 4229 states and 6538 transitions. [2019-11-06 22:24:46,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 6538 transitions. [2019-11-06 22:24:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 22:24:46,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:46,818 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:47,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:47,024 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1422823091, now seen corresponding path program 1 times [2019-11-06 22:24:47,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:47,024 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885202994] [2019-11-06 22:24:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 22:24:47,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885202994] [2019-11-06 22:24:47,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266849720] [2019-11-06 22:24:47,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:47,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:24:47,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-06 22:24:47,527 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:47,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-06 22:24:47,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344149447] [2019-11-06 22:24:47,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:47,529 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:47,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:47,529 INFO L87 Difference]: Start difference. First operand 4229 states and 6538 transitions. Second operand 3 states. [2019-11-06 22:24:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:47,849 INFO L93 Difference]: Finished difference Result 4234 states and 6544 transitions. [2019-11-06 22:24:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:47,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-06 22:24:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:47,865 INFO L225 Difference]: With dead ends: 4234 [2019-11-06 22:24:47,866 INFO L226 Difference]: Without dead ends: 4231 [2019-11-06 22:24:47,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-11-06 22:24:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4231. [2019-11-06 22:24:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4231 states. [2019-11-06 22:24:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4231 states to 4231 states and 6540 transitions. [2019-11-06 22:24:48,246 INFO L78 Accepts]: Start accepts. Automaton has 4231 states and 6540 transitions. Word has length 122 [2019-11-06 22:24:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:48,247 INFO L462 AbstractCegarLoop]: Abstraction has 4231 states and 6540 transitions. [2019-11-06 22:24:48,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4231 states and 6540 transitions. [2019-11-06 22:24:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 22:24:48,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:48,260 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:48,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:48,468 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1422770298, now seen corresponding path program 1 times [2019-11-06 22:24:48,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:48,469 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115272467] [2019-11-06 22:24:48,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 22:24:48,777 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115272467] [2019-11-06 22:24:48,778 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371171544] [2019-11-06 22:24:48,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 22:24:48,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:24:49,075 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:24:49,076 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-06 22:24:49,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268120815] [2019-11-06 22:24:49,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:49,077 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:49,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:49,078 INFO L87 Difference]: Start difference. First operand 4231 states and 6540 transitions. Second operand 9 states. [2019-11-06 22:24:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:51,500 INFO L93 Difference]: Finished difference Result 10484 states and 16653 transitions. [2019-11-06 22:24:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 22:24:51,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-11-06 22:24:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:51,529 INFO L225 Difference]: With dead ends: 10484 [2019-11-06 22:24:51,530 INFO L226 Difference]: Without dead ends: 6301 [2019-11-06 22:24:51,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2019-11-06 22:24:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 5042. [2019-11-06 22:24:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2019-11-06 22:24:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 7538 transitions. [2019-11-06 22:24:52,146 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 7538 transitions. Word has length 122 [2019-11-06 22:24:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:52,146 INFO L462 AbstractCegarLoop]: Abstraction has 5042 states and 7538 transitions. [2019-11-06 22:24:52,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:24:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 7538 transitions. [2019-11-06 22:24:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-06 22:24:52,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:52,173 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:52,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:52,380 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1128041771, now seen corresponding path program 1 times [2019-11-06 22:24:52,381 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:52,381 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283826783] [2019-11-06 22:24:52,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 22:24:52,649 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283826783] [2019-11-06 22:24:52,650 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:52,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:24:52,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420237301] [2019-11-06 22:24:52,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:24:52,651 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:24:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:52,651 INFO L87 Difference]: Start difference. First operand 5042 states and 7538 transitions. Second operand 7 states. [2019-11-06 22:24:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:54,691 INFO L93 Difference]: Finished difference Result 14409 states and 21933 transitions. [2019-11-06 22:24:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:24:54,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-11-06 22:24:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:54,730 INFO L225 Difference]: With dead ends: 14409 [2019-11-06 22:24:54,730 INFO L226 Difference]: Without dead ends: 9376 [2019-11-06 22:24:54,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:24:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states.