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/eca-rers2012/Problem12_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:09:52,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:09:52,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:09:52,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:09:52,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:09:52,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:09:52,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:09:52,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:09:52,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:09:52,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:09:52,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:09:52,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:09:52,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:09:52,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:09:52,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:09:52,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:09:52,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:09:52,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:09:52,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:09:52,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:09:52,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:09:52,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:09:52,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:09:52,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:09:52,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:09:52,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:09:52,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:09:52,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:09:52,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:09:52,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:09:52,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:09:52,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:09:52,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:09:52,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:09:52,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:09:52,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:09:52,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:09:52,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:09:52,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:09:52,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:09:52,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:09:52,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:09:52,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:09:52,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:09:52,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:09:52,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:09:52,525 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:09:52,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:09:52,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:09:52,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:09:52,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:09:52,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:09:52,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:09:52,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:09:52,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:09:52,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:09:52,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:09:52,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:09:52,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:09:52,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:09:52,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:09:52,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:09:52,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:09:52,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:09:52,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:09:52,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:09:52,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:09:52,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:09:52,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:09:52,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:09:52,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:09:52,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:09:52,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:09:52,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:09:52,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:09:52,582 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:09:52,583 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label12.c [2019-10-02 01:09:52,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b05186d/d9fb9a90562a41e590a62084d6026d59/FLAG7cef9b4a5 [2019-10-02 01:09:53,427 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:09:53,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label12.c [2019-10-02 01:09:53,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b05186d/d9fb9a90562a41e590a62084d6026d59/FLAG7cef9b4a5 [2019-10-02 01:09:53,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b05186d/d9fb9a90562a41e590a62084d6026d59 [2019-10-02 01:09:53,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:09:53,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:09:53,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:09:53,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:09:53,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:09:53,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:53" (1/1) ... [2019-10-02 01:09:53,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4559a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:53, skipping insertion in model container [2019-10-02 01:09:53,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:53" (1/1) ... [2019-10-02 01:09:54,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:09:54,160 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:09:55,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:09:55,586 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:09:56,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:09:56,256 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:09:56,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56 WrapperNode [2019-10-02 01:09:56,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:09:56,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:09:56,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:09:56,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:09:56,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... [2019-10-02 01:09:56,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:09:56,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:09:56,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:09:56,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:09:56,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:09:56,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:09:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:09:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:09:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:09:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-02 01:09:56,617 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-10-02 01:09:56,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:09:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:09:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:09:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-02 01:09:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-10-02 01:09:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:09:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:09:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:09:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:09:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:09:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:10:01,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:10:01,400 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:10:01,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:10:01 BoogieIcfgContainer [2019-10-02 01:10:01,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:10:01,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:10:01,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:10:01,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:10:01,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:09:53" (1/3) ... [2019-10-02 01:10:01,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:10:01, skipping insertion in model container [2019-10-02 01:10:01,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:56" (2/3) ... [2019-10-02 01:10:01,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c71d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:10:01, skipping insertion in model container [2019-10-02 01:10:01,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:10:01" (3/3) ... [2019-10-02 01:10:01,412 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label12.c [2019-10-02 01:10:01,423 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:10:01,434 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:10:01,451 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:10:01,503 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:10:01,504 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:10:01,504 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:10:01,504 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:10:01,504 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:10:01,505 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:10:01,505 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:10:01,505 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:10:01,505 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:10:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-10-02 01:10:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 01:10:01,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:01,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:10:01,562 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1107355747, now seen corresponding path program 1 times [2019-10-02 01:10:01,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:01,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:01,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:10:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:10:01,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:10:02,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:10:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:10:02,007 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 3 states. [2019-10-02 01:10:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:07,739 INFO L93 Difference]: Finished difference Result 2443 states and 4697 transitions. [2019-10-02 01:10:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:10:07,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-02 01:10:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:07,799 INFO L225 Difference]: With dead ends: 2443 [2019-10-02 01:10:07,800 INFO L226 Difference]: Without dead ends: 1542 [2019-10-02 01:10:07,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:10:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-02 01:10:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-10-02 01:10:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-10-02 01:10:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2750 transitions. [2019-10-02 01:10:08,047 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2750 transitions. Word has length 64 [2019-10-02 01:10:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:08,049 INFO L475 AbstractCegarLoop]: Abstraction has 1542 states and 2750 transitions. [2019-10-02 01:10:08,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:10:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2750 transitions. [2019-10-02 01:10:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 01:10:08,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:08,067 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:08,067 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash -493202935, now seen corresponding path program 1 times [2019-10-02 01:10:08,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:08,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:08,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:08,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:08,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:08,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:10:08,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:10:08,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:10:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:10:08,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:10:08,388 INFO L87 Difference]: Start difference. First operand 1542 states and 2750 transitions. Second operand 5 states. [2019-10-02 01:10:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:15,183 INFO L93 Difference]: Finished difference Result 4690 states and 8403 transitions. [2019-10-02 01:10:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:10:15,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-02 01:10:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:15,214 INFO L225 Difference]: With dead ends: 4690 [2019-10-02 01:10:15,214 INFO L226 Difference]: Without dead ends: 3154 [2019-10-02 01:10:15,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:10:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-10-02 01:10:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3122. [2019-10-02 01:10:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-10-02 01:10:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5336 transitions. [2019-10-02 01:10:15,308 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5336 transitions. Word has length 137 [2019-10-02 01:10:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:15,309 INFO L475 AbstractCegarLoop]: Abstraction has 3122 states and 5336 transitions. [2019-10-02 01:10:15,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:10:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5336 transitions. [2019-10-02 01:10:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 01:10:15,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:15,311 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:15,312 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1291094684, now seen corresponding path program 1 times [2019-10-02 01:10:15,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:15,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:15,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:10:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:10:15,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:10:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:10:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:10:15,493 INFO L87 Difference]: Start difference. First operand 3122 states and 5336 transitions. Second operand 6 states. [2019-10-02 01:10:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:23,095 INFO L93 Difference]: Finished difference Result 9491 states and 16483 transitions. [2019-10-02 01:10:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:10:23,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 01:10:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:23,143 INFO L225 Difference]: With dead ends: 9491 [2019-10-02 01:10:23,146 INFO L226 Difference]: Without dead ends: 6375 [2019-10-02 01:10:23,154 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:10:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-10-02 01:10:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6333. [2019-10-02 01:10:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-10-02 01:10:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 10771 transitions. [2019-10-02 01:10:23,388 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 10771 transitions. Word has length 142 [2019-10-02 01:10:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:23,389 INFO L475 AbstractCegarLoop]: Abstraction has 6333 states and 10771 transitions. [2019-10-02 01:10:23,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:10:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 10771 transitions. [2019-10-02 01:10:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 01:10:23,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:23,396 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:23,396 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138644, now seen corresponding path program 1 times [2019-10-02 01:10:23,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:23,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:23,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:10:23,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:10:23,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:10:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:10:23,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:10:23,626 INFO L87 Difference]: Start difference. First operand 6333 states and 10771 transitions. Second operand 6 states. [2019-10-02 01:10:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:30,098 INFO L93 Difference]: Finished difference Result 15980 states and 27530 transitions. [2019-10-02 01:10:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:10:30,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-02 01:10:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:30,147 INFO L225 Difference]: With dead ends: 15980 [2019-10-02 01:10:30,147 INFO L226 Difference]: Without dead ends: 9653 [2019-10-02 01:10:30,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:10:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-10-02 01:10:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9576. [2019-10-02 01:10:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2019-10-02 01:10:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 15604 transitions. [2019-10-02 01:10:30,392 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 15604 transitions. Word has length 150 [2019-10-02 01:10:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:30,394 INFO L475 AbstractCegarLoop]: Abstraction has 9576 states and 15604 transitions. [2019-10-02 01:10:30,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:10:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 15604 transitions. [2019-10-02 01:10:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 01:10:30,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:30,398 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:30,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash -124269619, now seen corresponding path program 1 times [2019-10-02 01:10:30,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:30,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:10:30,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:10:30,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:10:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:10:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:10:30,627 INFO L87 Difference]: Start difference. First operand 9576 states and 15604 transitions. Second operand 6 states. [2019-10-02 01:10:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:37,201 INFO L93 Difference]: Finished difference Result 24200 states and 40441 transitions. [2019-10-02 01:10:37,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:10:37,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-02 01:10:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:37,283 INFO L225 Difference]: With dead ends: 24200 [2019-10-02 01:10:37,283 INFO L226 Difference]: Without dead ends: 14630 [2019-10-02 01:10:37,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:10:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14630 states. [2019-10-02 01:10:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14630 to 14577. [2019-10-02 01:10:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14577 states. [2019-10-02 01:10:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14577 states to 14577 states and 21948 transitions. [2019-10-02 01:10:37,806 INFO L78 Accepts]: Start accepts. Automaton has 14577 states and 21948 transitions. Word has length 183 [2019-10-02 01:10:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:37,807 INFO L475 AbstractCegarLoop]: Abstraction has 14577 states and 21948 transitions. [2019-10-02 01:10:37,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:10:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14577 states and 21948 transitions. [2019-10-02 01:10:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 01:10:37,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:37,817 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:37,817 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1910943348, now seen corresponding path program 1 times [2019-10-02 01:10:37,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:37,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 117 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 01:10:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:38,066 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:10:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:38,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:10:38,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 187 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:10:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:10:38,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:10:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:10:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:10:38,335 INFO L87 Difference]: Start difference. First operand 14577 states and 21948 transitions. Second operand 9 states. [2019-10-02 01:10:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:53,986 INFO L93 Difference]: Finished difference Result 44402 states and 76819 transitions. [2019-10-02 01:10:53,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 01:10:53,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 233 [2019-10-02 01:10:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:54,197 INFO L225 Difference]: With dead ends: 44402 [2019-10-02 01:10:54,197 INFO L226 Difference]: Without dead ends: 29831 [2019-10-02 01:10:54,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 01:10:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29831 states. [2019-10-02 01:10:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29831 to 26070. [2019-10-02 01:10:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26070 states. [2019-10-02 01:10:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26070 states to 26070 states and 36460 transitions. [2019-10-02 01:10:55,309 INFO L78 Accepts]: Start accepts. Automaton has 26070 states and 36460 transitions. Word has length 233 [2019-10-02 01:10:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:55,311 INFO L475 AbstractCegarLoop]: Abstraction has 26070 states and 36460 transitions. [2019-10-02 01:10:55,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:10:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 26070 states and 36460 transitions. [2019-10-02 01:10:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 01:10:55,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:55,323 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:10:55,323 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1672249469, now seen corresponding path program 1 times [2019-10-02 01:10:55,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:55,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:55,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:10:55,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:55,496 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:10:55,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:55,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:10:55,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 01:10:55,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:10:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-10-02 01:10:55,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:10:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:10:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:10:55,744 INFO L87 Difference]: Start difference. First operand 26070 states and 36460 transitions. Second operand 6 states. [2019-10-02 01:11:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:05,998 INFO L93 Difference]: Finished difference Result 74526 states and 110092 transitions. [2019-10-02 01:11:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:11:05,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-02 01:11:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:06,150 INFO L225 Difference]: With dead ends: 74526 [2019-10-02 01:11:06,151 INFO L226 Difference]: Without dead ends: 48462 [2019-10-02 01:11:06,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:11:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48462 states. [2019-10-02 01:11:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48462 to 45596. [2019-10-02 01:11:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45596 states. [2019-10-02 01:11:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45596 states to 45596 states and 62074 transitions. [2019-10-02 01:11:07,139 INFO L78 Accepts]: Start accepts. Automaton has 45596 states and 62074 transitions. Word has length 258 [2019-10-02 01:11:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:07,140 INFO L475 AbstractCegarLoop]: Abstraction has 45596 states and 62074 transitions. [2019-10-02 01:11:07,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:11:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45596 states and 62074 transitions. [2019-10-02 01:11:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 01:11:07,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:07,147 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-10-02 01:11:07,147 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash -626123186, now seen corresponding path program 1 times [2019-10-02 01:11:07,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:07,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:07,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 127 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:11:07,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:07,477 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:11:07,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:07,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:11:07,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:11:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 01:11:07,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:11:07,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-10-02 01:11:07,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:11:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:11:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:11:07,833 INFO L87 Difference]: Start difference. First operand 45596 states and 62074 transitions. Second operand 11 states. [2019-10-02 01:11:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:53,008 INFO L93 Difference]: Finished difference Result 167104 states and 245635 transitions. [2019-10-02 01:11:53,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 01:11:53,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 285 [2019-10-02 01:11:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:53,416 INFO L225 Difference]: With dead ends: 167104 [2019-10-02 01:11:53,417 INFO L226 Difference]: Without dead ends: 121514 [2019-10-02 01:11:53,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=585, Invalid=2607, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 01:11:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121514 states. [2019-10-02 01:11:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121514 to 112861. [2019-10-02 01:11:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112861 states. [2019-10-02 01:11:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112861 states to 112861 states and 155770 transitions. [2019-10-02 01:11:57,869 INFO L78 Accepts]: Start accepts. Automaton has 112861 states and 155770 transitions. Word has length 285 [2019-10-02 01:11:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 112861 states and 155770 transitions. [2019-10-02 01:11:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:11:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 112861 states and 155770 transitions. [2019-10-02 01:11:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2019-10-02 01:11:58,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:58,173 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:11:58,173 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -63806270, now seen corresponding path program 1 times [2019-10-02 01:11:58,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:58,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 248 proven. 204 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 01:11:59,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:59,844 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:12:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:12:00,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:12:00,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:12:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 465 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:12:01,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:12:01,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:12:01,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:12:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:12:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:12:01,078 INFO L87 Difference]: Start difference. First operand 112861 states and 155770 transitions. Second operand 9 states. [2019-10-02 01:12:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:12:15,302 INFO L93 Difference]: Finished difference Result 265239 states and 398198 transitions. [2019-10-02 01:12:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:12:15,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 919 [2019-10-02 01:12:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:12:15,763 INFO L225 Difference]: With dead ends: 265239 [2019-10-02 01:12:15,763 INFO L226 Difference]: Without dead ends: 141630 [2019-10-02 01:12:15,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:12:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141630 states. [2019-10-02 01:12:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141630 to 126488. [2019-10-02 01:12:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126488 states. [2019-10-02 01:12:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126488 states to 126488 states and 178801 transitions. [2019-10-02 01:12:22,062 INFO L78 Accepts]: Start accepts. Automaton has 126488 states and 178801 transitions. Word has length 919 [2019-10-02 01:12:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:12:22,063 INFO L475 AbstractCegarLoop]: Abstraction has 126488 states and 178801 transitions. [2019-10-02 01:12:22,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:12:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 126488 states and 178801 transitions. [2019-10-02 01:12:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2019-10-02 01:12:22,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:12:22,393 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:12:22,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:12:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:12:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1477834369, now seen corresponding path program 1 times [2019-10-02 01:12:22,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:12:22,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:12:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:12:22,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:12:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:12:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:12:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 298 proven. 569 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-10-02 01:12:24,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:12:24,676 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:12:24,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:12:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:12:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:12:25,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:12:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 771 proven. 2 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-10-02 01:12:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:12:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:12:25,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:12:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:12:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:12:25,956 INFO L87 Difference]: Start difference. First operand 126488 states and 178801 transitions. Second operand 9 states. [2019-10-02 01:12:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:12:38,498 INFO L93 Difference]: Finished difference Result 309464 states and 441873 transitions. [2019-10-02 01:12:38,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:12:38,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1201 [2019-10-02 01:12:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:12:39,465 INFO L225 Difference]: With dead ends: 309464 [2019-10-02 01:12:39,465 INFO L226 Difference]: Without dead ends: 182982 [2019-10-02 01:12:39,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1223 GetRequests, 1207 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:12:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182982 states. [2019-10-02 01:12:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182982 to 156499. [2019-10-02 01:12:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156499 states. [2019-10-02 01:12:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156499 states to 156499 states and 206573 transitions. [2019-10-02 01:12:46,127 INFO L78 Accepts]: Start accepts. Automaton has 156499 states and 206573 transitions. Word has length 1201 [2019-10-02 01:12:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:12:46,128 INFO L475 AbstractCegarLoop]: Abstraction has 156499 states and 206573 transitions. [2019-10-02 01:12:46,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:12:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 156499 states and 206573 transitions. [2019-10-02 01:12:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-10-02 01:12:46,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:12:46,331 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:12:46,331 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:12:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:12:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 425069290, now seen corresponding path program 1 times [2019-10-02 01:12:46,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:12:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:12:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:12:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:12:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:12:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:12:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 323 proven. 176 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-02 01:12:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:12:48,026 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:12:48,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:12:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:12:48,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:12:48,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:12:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 667 proven. 2 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-02 01:12:51,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:12:51,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:12:51,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:12:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:12:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:12:51,102 INFO L87 Difference]: Start difference. First operand 156499 states and 206573 transitions. Second operand 9 states. [2019-10-02 01:13:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:13:08,818 INFO L93 Difference]: Finished difference Result 439190 states and 643239 transitions. [2019-10-02 01:13:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:13:08,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1078 [2019-10-02 01:13:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:13:09,786 INFO L225 Difference]: With dead ends: 439190 [2019-10-02 01:13:09,787 INFO L226 Difference]: Without dead ends: 281143 [2019-10-02 01:13:10,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:13:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281143 states. [2019-10-02 01:13:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281143 to 278747. [2019-10-02 01:13:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278747 states. [2019-10-02 01:13:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278747 states to 278747 states and 395918 transitions. [2019-10-02 01:13:21,999 INFO L78 Accepts]: Start accepts. Automaton has 278747 states and 395918 transitions. Word has length 1078 [2019-10-02 01:13:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:13:22,000 INFO L475 AbstractCegarLoop]: Abstraction has 278747 states and 395918 transitions. [2019-10-02 01:13:22,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:13:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 278747 states and 395918 transitions. [2019-10-02 01:13:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1419 [2019-10-02 01:13:23,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:13:23,007 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:13:23,008 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:13:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:13:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1103524205, now seen corresponding path program 1 times [2019-10-02 01:13:23,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:13:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:13:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 444 proven. 782 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2019-10-02 01:13:26,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:13:26,960 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:13:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:31,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1866 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:13:31,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:13:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2114 backedges. 1351 proven. 2 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2019-10-02 01:13:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:13:32,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:13:32,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:13:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:13:32,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:13:32,368 INFO L87 Difference]: Start difference. First operand 278747 states and 395918 transitions. Second operand 11 states. [2019-10-02 01:14:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:14:05,020 INFO L93 Difference]: Finished difference Result 652675 states and 929100 transitions. [2019-10-02 01:14:05,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 01:14:05,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1418 [2019-10-02 01:14:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:14:07,245 INFO L225 Difference]: With dead ends: 652675 [2019-10-02 01:14:07,245 INFO L226 Difference]: Without dead ends: 370742 [2019-10-02 01:14:07,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1511 GetRequests, 1459 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 01:14:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370742 states. [2019-10-02 01:14:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370742 to 367470. [2019-10-02 01:14:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367470 states. [2019-10-02 01:14:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367470 states to 367470 states and 466282 transitions. [2019-10-02 01:14:26,911 INFO L78 Accepts]: Start accepts. Automaton has 367470 states and 466282 transitions. Word has length 1418 [2019-10-02 01:14:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:14:26,912 INFO L475 AbstractCegarLoop]: Abstraction has 367470 states and 466282 transitions. [2019-10-02 01:14:26,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:14:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 367470 states and 466282 transitions. [2019-10-02 01:14:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2019-10-02 01:14:27,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:14:27,727 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:14:27,727 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:14:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:14:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -433148109, now seen corresponding path program 1 times [2019-10-02 01:14:27,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:14:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:14:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:14:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:14:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:14:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:14:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 725 proven. 154 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2019-10-02 01:14:35,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:14:35,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:14:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:14:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:14:36,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:14:36,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:14:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 1285 proven. 2 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-10-02 01:14:36,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:14:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:14:36,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:14:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:14:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:14:36,873 INFO L87 Difference]: Start difference. First operand 367470 states and 466282 transitions. Second operand 9 states. [2019-10-02 01:15:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:15:00,603 INFO L93 Difference]: Finished difference Result 777747 states and 1027185 transitions. [2019-10-02 01:15:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:15:00,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1385 [2019-10-02 01:15:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:15:02,036 INFO L225 Difference]: With dead ends: 777747 [2019-10-02 01:15:02,037 INFO L226 Difference]: Without dead ends: 411050 [2019-10-02 01:15:02,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1404 GetRequests, 1390 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:15:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411050 states. [2019-10-02 01:15:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411050 to 410181. [2019-10-02 01:15:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410181 states. [2019-10-02 01:15:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410181 states to 410181 states and 526494 transitions. [2019-10-02 01:15:13,108 INFO L78 Accepts]: Start accepts. Automaton has 410181 states and 526494 transitions. Word has length 1385 [2019-10-02 01:15:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:15:13,109 INFO L475 AbstractCegarLoop]: Abstraction has 410181 states and 526494 transitions. [2019-10-02 01:15:13,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:15:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 410181 states and 526494 transitions. [2019-10-02 01:15:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2019-10-02 01:15:14,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:15:14,194 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:15:14,195 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:15:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:15:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1407290730, now seen corresponding path program 1 times [2019-10-02 01:15:14,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:15:14,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:15:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:14,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:14,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3497 backedges. 665 proven. 406 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked. [2019-10-02 01:15:22,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:15:22,524 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:15:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:22,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:15:22,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:15:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3497 backedges. 1949 proven. 2 refuted. 0 times theorem prover too weak. 1546 trivial. 0 not checked. [2019-10-02 01:15:23,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:15:23,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 01:15:23,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:15:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:15:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:15:23,863 INFO L87 Difference]: Start difference. First operand 410181 states and 526494 transitions. Second operand 8 states. [2019-10-02 01:15:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:15:38,635 INFO L93 Difference]: Finished difference Result 725711 states and 897623 transitions. [2019-10-02 01:15:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:15:38,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1625 [2019-10-02 01:15:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:15:39,468 INFO L225 Difference]: With dead ends: 725711 [2019-10-02 01:15:39,469 INFO L226 Difference]: Without dead ends: 316303 [2019-10-02 01:15:40,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1639 GetRequests, 1628 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:15:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316303 states. [2019-10-02 01:15:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316303 to 312023. [2019-10-02 01:15:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312023 states. [2019-10-02 01:15:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312023 states to 312023 states and 343078 transitions. [2019-10-02 01:15:51,650 INFO L78 Accepts]: Start accepts. Automaton has 312023 states and 343078 transitions. Word has length 1625 [2019-10-02 01:15:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:15:51,651 INFO L475 AbstractCegarLoop]: Abstraction has 312023 states and 343078 transitions. [2019-10-02 01:15:51,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:15:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 312023 states and 343078 transitions. [2019-10-02 01:15:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1421 [2019-10-02 01:15:51,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:15:51,966 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:15:51,967 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:15:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:15:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2142135735, now seen corresponding path program 1 times [2019-10-02 01:15:51,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:15:51,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:15:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:51,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:15:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 1356 proven. 6 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-02 01:15:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:15:59,180 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:15:59,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:15:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:15:59,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1862 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 01:15:59,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:16:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 1017 proven. 2 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-10-02 01:16:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:16:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 01:16:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:16:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:16:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:16:00,573 INFO L87 Difference]: Start difference. First operand 312023 states and 343078 transitions. Second operand 6 states. [2019-10-02 01:16:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:16:09,162 INFO L93 Difference]: Finished difference Result 625436 states and 691523 transitions. [2019-10-02 01:16:09,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:16:09,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1420 [2019-10-02 01:16:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:16:09,826 INFO L225 Difference]: With dead ends: 625436 [2019-10-02 01:16:09,826 INFO L226 Difference]: Without dead ends: 305763 [2019-10-02 01:16:10,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:16:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305763 states. [2019-10-02 01:16:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305763 to 302496. [2019-10-02 01:16:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302496 states. [2019-10-02 01:16:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302496 states to 302496 states and 325410 transitions. [2019-10-02 01:16:16,574 INFO L78 Accepts]: Start accepts. Automaton has 302496 states and 325410 transitions. Word has length 1420 [2019-10-02 01:16:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:16:16,575 INFO L475 AbstractCegarLoop]: Abstraction has 302496 states and 325410 transitions. [2019-10-02 01:16:16,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:16:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 302496 states and 325410 transitions. [2019-10-02 01:16:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1503 [2019-10-02 01:16:16,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:16:16,914 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:16:16,914 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:16:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:16:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1202077663, now seen corresponding path program 1 times [2019-10-02 01:16:16,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:16:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:16:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:16:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:16:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:16:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:16:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2019-10-02 01:16:23,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:16:23,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:16:23,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:16:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:16:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:16:23,102 INFO L87 Difference]: Start difference. First operand 302496 states and 325410 transitions. Second operand 4 states. [2019-10-02 01:16:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:16:31,925 INFO L93 Difference]: Finished difference Result 658835 states and 709568 transitions. [2019-10-02 01:16:31,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:16:31,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1502 [2019-10-02 01:16:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:16:31,930 INFO L225 Difference]: With dead ends: 658835 [2019-10-02 01:16:31,931 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:16:32,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:16:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:16:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:16:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:16:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:16:32,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1502 [2019-10-02 01:16:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:16:32,969 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:16:32,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:16:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:16:32,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:16:32,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:16:34,809 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-02 01:17:54,851 WARN L191 SmtUtils]: Spent 1.15 m on a formula simplification. DAG size of input: 4008 DAG size of output: 3458 [2019-10-02 01:19:05,761 WARN L191 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 4008 DAG size of output: 3458 [2019-10-02 01:19:27,989 WARN L191 SmtUtils]: Spent 22.10 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:19:49,502 WARN L191 SmtUtils]: Spent 21.31 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:20:10,761 WARN L191 SmtUtils]: Spent 21.17 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:20:31,822 WARN L191 SmtUtils]: Spent 20.96 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:20:53,000 WARN L191 SmtUtils]: Spent 21.11 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:21:14,170 WARN L191 SmtUtils]: Spent 21.06 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175 [2019-10-02 01:21:35,296 WARN L191 SmtUtils]: Spent 21.03 s on a formula simplification. DAG size of input: 1325 DAG size of output: 175