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/Problem17_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:56:27,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:56:27,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:56:27,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:56:27,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:56:27,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:56:27,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:56:27,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:56:27,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:56:27,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:56:27,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:56:27,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:56:27,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:56:27,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:56:27,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:56:27,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:56:27,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:56:27,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:56:27,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:56:27,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:56:27,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:56:27,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:56:27,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:56:27,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:56:27,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:56:27,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:56:27,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:56:27,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:56:27,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:56:27,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:56:27,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:56:27,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:56:27,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:56:27,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:56:27,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:56:27,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:56:27,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:56:27,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:56:27,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:56:27,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:56:27,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:56:27,607 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-09-07 21:56:27,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:56:27,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:56:27,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:56:27,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:56:27,622 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:56:27,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:56:27,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:56:27,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:56:27,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:56:27,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:56:27,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:56:27,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:56:27,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:56:27,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:56:27,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:56:27,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:56:27,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:56:27,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:56:27,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:56:27,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:56:27,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:56:27,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:56:27,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:56:27,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:56:27,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:56:27,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:56:27,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:56:27,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:56:27,692 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:56:27,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label39.c [2019-09-07 21:56:27,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9fdc9e7/92412bbef0c34a318a4dab167ee5778e/FLAG54d6f839d [2019-09-07 21:56:28,385 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:56:28,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label39.c [2019-09-07 21:56:28,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9fdc9e7/92412bbef0c34a318a4dab167ee5778e/FLAG54d6f839d [2019-09-07 21:56:28,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9fdc9e7/92412bbef0c34a318a4dab167ee5778e [2019-09-07 21:56:28,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:56:28,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:56:28,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:56:28,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:56:28,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:56:28,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:56:28" (1/1) ... [2019-09-07 21:56:28,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df7a19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:28, skipping insertion in model container [2019-09-07 21:56:28,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:56:28" (1/1) ... [2019-09-07 21:56:28,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:56:28,687 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:56:29,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:56:29,938 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:56:30,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:56:30,370 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:56:30,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30 WrapperNode [2019-09-07 21:56:30,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:56:30,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:56:30,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:56:30,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:56:30,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (1/1) ... [2019-09-07 21:56:30,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:56:30,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:56:30,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:56:30,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:56:30,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (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-09-07 21:56:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:56:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:56:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:56:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:56:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:56:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:56:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:56:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:56:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:56:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:56:30,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:56:30,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:56:30,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:56:34,908 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:56:34,908 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:56:34,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:56:34 BoogieIcfgContainer [2019-09-07 21:56:34,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:56:34,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:56:34,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:56:34,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:56:34,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:56:28" (1/3) ... [2019-09-07 21:56:34,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a475298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:56:34, skipping insertion in model container [2019-09-07 21:56:34,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:56:30" (2/3) ... [2019-09-07 21:56:34,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a475298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:56:34, skipping insertion in model container [2019-09-07 21:56:34,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:56:34" (3/3) ... [2019-09-07 21:56:34,931 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label39.c [2019-09-07 21:56:34,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:56:34,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:56:34,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:56:35,058 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:56:35,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:56:35,060 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:56:35,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:56:35,061 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:56:35,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:56:35,061 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:56:35,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:56:35,062 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:56:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:56:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 21:56:35,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:56:35,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:56:35,134 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:56:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:56:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1747259231, now seen corresponding path program 1 times [2019-09-07 21:56:35,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:56:35,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:56:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:56:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:56:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:56:35,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:56:35,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:56:35,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:56:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:56:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:56:35,707 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:56:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:56:42,051 INFO L93 Difference]: Finished difference Result 2121 states and 3950 transitions. [2019-09-07 21:56:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:56:42,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-07 21:56:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:56:42,080 INFO L225 Difference]: With dead ends: 2121 [2019-09-07 21:56:42,081 INFO L226 Difference]: Without dead ends: 1439 [2019-09-07 21:56:42,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-07 21:56:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-09-07 21:56:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 981. [2019-09-07 21:56:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-09-07 21:56:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1512 transitions. [2019-09-07 21:56:42,221 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1512 transitions. Word has length 69 [2019-09-07 21:56:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:56:42,222 INFO L475 AbstractCegarLoop]: Abstraction has 981 states and 1512 transitions. [2019-09-07 21:56:42,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:56:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1512 transitions. [2019-09-07 21:56:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 21:56:42,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:56:42,239 INFO L399 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:56:42,240 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:56:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:56:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1044902793, now seen corresponding path program 1 times [2019-09-07 21:56:42,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:56:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:56:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:42,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:56:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:56:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:56:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:56:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:56:42,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:56:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:56:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:56:42,475 INFO L87 Difference]: Start difference. First operand 981 states and 1512 transitions. Second operand 5 states. [2019-09-07 21:56:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:56:46,916 INFO L93 Difference]: Finished difference Result 2889 states and 4497 transitions. [2019-09-07 21:56:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:56:46,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-09-07 21:56:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:56:46,936 INFO L225 Difference]: With dead ends: 2889 [2019-09-07 21:56:46,936 INFO L226 Difference]: Without dead ends: 1914 [2019-09-07 21:56:46,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:56:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-09-07 21:56:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1890. [2019-09-07 21:56:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-09-07 21:56:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2682 transitions. [2019-09-07 21:56:47,022 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2682 transitions. Word has length 140 [2019-09-07 21:56:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:56:47,023 INFO L475 AbstractCegarLoop]: Abstraction has 1890 states and 2682 transitions. [2019-09-07 21:56:47,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:56:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2682 transitions. [2019-09-07 21:56:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 21:56:47,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:56:47,026 INFO L399 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, 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] [2019-09-07 21:56:47,026 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:56:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:56:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1036271817, now seen corresponding path program 1 times [2019-09-07 21:56:47,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:56:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:56:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:56:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:56:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:56:47,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:56:47,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:56:47,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:56:47,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:56:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:56:47,286 INFO L87 Difference]: Start difference. First operand 1890 states and 2682 transitions. Second operand 4 states. [2019-09-07 21:56:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:56:52,599 INFO L93 Difference]: Finished difference Result 5556 states and 8388 transitions. [2019-09-07 21:56:52,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:56:52,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-07 21:56:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:56:52,625 INFO L225 Difference]: With dead ends: 5556 [2019-09-07 21:56:52,625 INFO L226 Difference]: Without dead ends: 3672 [2019-09-07 21:56:52,630 INFO L628 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-09-07 21:56:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2019-09-07 21:56:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3669. [2019-09-07 21:56:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3669 states. [2019-09-07 21:56:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 5050 transitions. [2019-09-07 21:56:52,743 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 5050 transitions. Word has length 143 [2019-09-07 21:56:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:56:52,752 INFO L475 AbstractCegarLoop]: Abstraction has 3669 states and 5050 transitions. [2019-09-07 21:56:52,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:56:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 5050 transitions. [2019-09-07 21:56:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 21:56:52,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:56:52,756 INFO L399 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, 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] [2019-09-07 21:56:52,756 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:56:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:56:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash -192491641, now seen corresponding path program 1 times [2019-09-07 21:56:52,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:56:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:56:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:56:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:56:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:56:52,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:56:52,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:56:52,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:56:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:56:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:56:52,937 INFO L87 Difference]: Start difference. First operand 3669 states and 5050 transitions. Second operand 6 states. [2019-09-07 21:56:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:56:57,015 INFO L93 Difference]: Finished difference Result 9174 states and 12662 transitions. [2019-09-07 21:56:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:56:57,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-07 21:56:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:56:57,042 INFO L225 Difference]: With dead ends: 9174 [2019-09-07 21:56:57,042 INFO L226 Difference]: Without dead ends: 5511 [2019-09-07 21:56:57,052 INFO L628 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-09-07 21:56:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2019-09-07 21:56:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5481. [2019-09-07 21:56:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5481 states. [2019-09-07 21:56:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 6602 transitions. [2019-09-07 21:56:57,176 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 6602 transitions. Word has length 148 [2019-09-07 21:56:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:56:57,176 INFO L475 AbstractCegarLoop]: Abstraction has 5481 states and 6602 transitions. [2019-09-07 21:56:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:56:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6602 transitions. [2019-09-07 21:56:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 21:56:57,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:56:57,182 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:56:57,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:56:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:56:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1590292482, now seen corresponding path program 1 times [2019-09-07 21:56:57,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:56:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:56:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:56:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:56:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:56:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 21:56:57,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:56:57,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:56:57,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:56:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:56:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:56:57,347 INFO L87 Difference]: Start difference. First operand 5481 states and 6602 transitions. Second operand 4 states. [2019-09-07 21:57:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:57:02,765 INFO L93 Difference]: Finished difference Result 21532 states and 26537 transitions. [2019-09-07 21:57:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:57:02,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-07 21:57:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:57:02,824 INFO L225 Difference]: With dead ends: 21532 [2019-09-07 21:57:02,825 INFO L226 Difference]: Without dead ends: 16057 [2019-09-07 21:57:02,841 INFO L628 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-09-07 21:57:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-09-07 21:57:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 13451. [2019-09-07 21:57:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13451 states. [2019-09-07 21:57:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13451 states to 13451 states and 15868 transitions. [2019-09-07 21:57:03,144 INFO L78 Accepts]: Start accepts. Automaton has 13451 states and 15868 transitions. Word has length 242 [2019-09-07 21:57:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:57:03,145 INFO L475 AbstractCegarLoop]: Abstraction has 13451 states and 15868 transitions. [2019-09-07 21:57:03,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:57:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13451 states and 15868 transitions. [2019-09-07 21:57:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-07 21:57:03,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:57:03,151 INFO L399 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, 3, 3, 3, 3, 3, 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] [2019-09-07 21:57:03,151 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:57:03,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:57:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1302793758, now seen corresponding path program 1 times [2019-09-07 21:57:03,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:57:03,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:57:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:57:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:57:03,421 INFO L223 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) [2019-09-07 21:57:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:57:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:03,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:57:03,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:57:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 21:57:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:57:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:57:03,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:57:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:57:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:57:03,717 INFO L87 Difference]: Start difference. First operand 13451 states and 15868 transitions. Second operand 9 states. [2019-09-07 21:57:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:57:11,105 INFO L93 Difference]: Finished difference Result 28328 states and 33782 transitions. [2019-09-07 21:57:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:57:11,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2019-09-07 21:57:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:57:11,163 INFO L225 Difference]: With dead ends: 28328 [2019-09-07 21:57:11,163 INFO L226 Difference]: Without dead ends: 14024 [2019-09-07 21:57:11,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:57:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14024 states. [2019-09-07 21:57:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14024 to 13145. [2019-09-07 21:57:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13145 states. [2019-09-07 21:57:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13145 states to 13145 states and 16008 transitions. [2019-09-07 21:57:11,652 INFO L78 Accepts]: Start accepts. Automaton has 13145 states and 16008 transitions. Word has length 252 [2019-09-07 21:57:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:57:11,653 INFO L475 AbstractCegarLoop]: Abstraction has 13145 states and 16008 transitions. [2019-09-07 21:57:11,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:57:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 13145 states and 16008 transitions. [2019-09-07 21:57:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-07 21:57:11,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:57:11,679 INFO L399 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, 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, 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] [2019-09-07 21:57:11,679 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:57:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:57:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1891792481, now seen corresponding path program 1 times [2019-09-07 21:57:11,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:57:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:57:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 21:57:12,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:57:12,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:57:12,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:57:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:57:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:57:12,087 INFO L87 Difference]: Start difference. First operand 13145 states and 16008 transitions. Second operand 3 states. [2019-09-07 21:57:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:57:16,272 INFO L93 Difference]: Finished difference Result 36074 states and 45157 transitions. [2019-09-07 21:57:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:57:16,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-09-07 21:57:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:57:16,384 INFO L225 Difference]: With dead ends: 36074 [2019-09-07 21:57:16,385 INFO L226 Difference]: Without dead ends: 22939 [2019-09-07 21:57:16,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:57:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22939 states. [2019-09-07 21:57:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22939 to 21150. [2019-09-07 21:57:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21150 states. [2019-09-07 21:57:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21150 states to 21150 states and 26637 transitions. [2019-09-07 21:57:16,968 INFO L78 Accepts]: Start accepts. Automaton has 21150 states and 26637 transitions. Word has length 353 [2019-09-07 21:57:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:57:16,969 INFO L475 AbstractCegarLoop]: Abstraction has 21150 states and 26637 transitions. [2019-09-07 21:57:16,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:57:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 21150 states and 26637 transitions. [2019-09-07 21:57:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-07 21:57:16,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:57:16,992 INFO L399 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, 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] [2019-09-07 21:57:16,993 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:57:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:57:16,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1892666138, now seen corresponding path program 1 times [2019-09-07 21:57:16,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:57:16,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:57:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:16,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:57:18,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:57:18,372 INFO L223 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) [2019-09-07 21:57:18,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:57:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:18,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:57:18,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:57:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:57:18,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:57:18,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 21:57:18,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:57:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:57:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:57:18,837 INFO L87 Difference]: Start difference. First operand 21150 states and 26637 transitions. Second operand 11 states. [2019-09-07 21:57:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:57:42,402 INFO L93 Difference]: Finished difference Result 72469 states and 94916 transitions. [2019-09-07 21:57:42,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 21:57:42,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 416 [2019-09-07 21:57:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:57:42,611 INFO L225 Difference]: With dead ends: 72469 [2019-09-07 21:57:42,611 INFO L226 Difference]: Without dead ends: 50018 [2019-09-07 21:57:42,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 21:57:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50018 states. [2019-09-07 21:57:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50018 to 42342. [2019-09-07 21:57:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42342 states. [2019-09-07 21:57:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42342 states to 42342 states and 56039 transitions. [2019-09-07 21:57:43,651 INFO L78 Accepts]: Start accepts. Automaton has 42342 states and 56039 transitions. Word has length 416 [2019-09-07 21:57:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:57:43,652 INFO L475 AbstractCegarLoop]: Abstraction has 42342 states and 56039 transitions. [2019-09-07 21:57:43,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:57:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 42342 states and 56039 transitions. [2019-09-07 21:57:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-07 21:57:43,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:57:43,688 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:57:43,688 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:57:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:57:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1339801125, now seen corresponding path program 1 times [2019-09-07 21:57:43,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:57:43,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:57:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:43,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:57:44,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:57:44,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:57:44,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:57:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:57:44,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:57:44,155 INFO L87 Difference]: Start difference. First operand 42342 states and 56039 transitions. Second operand 3 states. [2019-09-07 21:57:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:57:49,820 INFO L93 Difference]: Finished difference Result 94308 states and 126184 transitions. [2019-09-07 21:57:49,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:57:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 444 [2019-09-07 21:57:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:57:50,014 INFO L225 Difference]: With dead ends: 94308 [2019-09-07 21:57:50,014 INFO L226 Difference]: Without dead ends: 52405 [2019-09-07 21:57:50,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:57:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52405 states. [2019-09-07 21:57:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52405 to 44083. [2019-09-07 21:57:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44083 states. [2019-09-07 21:57:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44083 states to 44083 states and 56882 transitions. [2019-09-07 21:57:52,251 INFO L78 Accepts]: Start accepts. Automaton has 44083 states and 56882 transitions. Word has length 444 [2019-09-07 21:57:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:57:52,252 INFO L475 AbstractCegarLoop]: Abstraction has 44083 states and 56882 transitions. [2019-09-07 21:57:52,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:57:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44083 states and 56882 transitions. [2019-09-07 21:57:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-07 21:57:52,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:57:52,314 INFO L399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 21:57:52,314 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:57:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:57:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945759, now seen corresponding path program 1 times [2019-09-07 21:57:52,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:57:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:57:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:52,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:57:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 21:57:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:57:53,118 INFO L223 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:57:53,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:57:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:57:53,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 21:57:53,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:57:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:57:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:57:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 21:57:54,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:57:54,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-09-07 21:57:54,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:57:54,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:57:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:57:54,161 INFO L87 Difference]: Start difference. First operand 44083 states and 56882 transitions. Second operand 11 states. [2019-09-07 22:01:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:01:07,531 INFO L93 Difference]: Finished difference Result 101226 states and 132891 transitions. [2019-09-07 22:01:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 22:01:07,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 566 [2019-09-07 22:01:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:01:07,735 INFO L225 Difference]: With dead ends: 101226 [2019-09-07 22:01:07,735 INFO L226 Difference]: Without dead ends: 57582 [2019-09-07 22:01:07,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-07 22:01:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57582 states. [2019-09-07 22:01:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57582 to 49026. [2019-09-07 22:01:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49026 states. [2019-09-07 22:01:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49026 states to 49026 states and 62734 transitions. [2019-09-07 22:01:08,905 INFO L78 Accepts]: Start accepts. Automaton has 49026 states and 62734 transitions. Word has length 566 [2019-09-07 22:01:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:01:08,907 INFO L475 AbstractCegarLoop]: Abstraction has 49026 states and 62734 transitions. [2019-09-07 22:01:08,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:01:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49026 states and 62734 transitions. [2019-09-07 22:01:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-09-07 22:01:09,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:01:09,016 INFO L399 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, 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, 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] [2019-09-07 22:01:09,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:01:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:01:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1430634720, now seen corresponding path program 1 times [2019-09-07 22:01:09,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:01:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:01:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:01:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:01:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 290 proven. 102 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 22:01:10,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:01:10,087 INFO L223 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-09-07 22:01:10,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:01:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:01:10,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:01:10,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:01:10,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:01:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-07 22:01:10,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:01:10,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:01:10,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:01:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:01:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:01:10,739 INFO L87 Difference]: Start difference. First operand 49026 states and 62734 transitions. Second operand 9 states. [2019-09-07 22:01:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:01:23,433 INFO L93 Difference]: Finished difference Result 108959 states and 141390 transitions. [2019-09-07 22:01:23,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 22:01:23,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 690 [2019-09-07 22:01:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:01:23,585 INFO L225 Difference]: With dead ends: 108959 [2019-09-07 22:01:23,585 INFO L226 Difference]: Without dead ends: 59906 [2019-09-07 22:01:23,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2019-09-07 22:01:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59906 states. [2019-09-07 22:01:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59906 to 57506. [2019-09-07 22:01:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57506 states. [2019-09-07 22:01:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57506 states to 57506 states and 69411 transitions. [2019-09-07 22:01:25,123 INFO L78 Accepts]: Start accepts. Automaton has 57506 states and 69411 transitions. Word has length 690 [2019-09-07 22:01:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:01:25,123 INFO L475 AbstractCegarLoop]: Abstraction has 57506 states and 69411 transitions. [2019-09-07 22:01:25,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:01:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 57506 states and 69411 transitions. [2019-09-07 22:01:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2019-09-07 22:01:25,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:01:25,205 INFO L399 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, 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, 3, 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] [2019-09-07 22:01:25,205 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:01:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:01:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -213258284, now seen corresponding path program 1 times [2019-09-07 22:01:25,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:01:25,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:01:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:25,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:01:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:01:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:01:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 430 proven. 102 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-07 22:01:25,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:01:25,896 INFO L223 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-09-07 22:01:25,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:01:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:01:26,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 22:01:26,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:01:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:26,449 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 32 [2019-09-07 22:01:27,172 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-07 22:01:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 22:01:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:01:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:01:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:01:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:01:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 22:01:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:01:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:01:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:27,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:01:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:01:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:01:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 505 proven. 191 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:01:30,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:01:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2019-09-07 22:01:30,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:01:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:01:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:01:30,315 INFO L87 Difference]: Start difference. First operand 57506 states and 69411 transitions. Second operand 16 states. [2019-09-07 22:01:32,879 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-07 22:01:33,043 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-07 22:01:36,072 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-07 22:01:36,627 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-07 22:01:41,526 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-07 22:01:43,666 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-07 22:01:58,323 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-07 22:02:10,180 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-07 22:02:10,605 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-07 22:02:17,671 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 22:02:18,449 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-07 22:02:19,186 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-07 22:02:19,346 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-07 22:02:20,208 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-07 22:02:20,845 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-07 22:02:28,671 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-07 22:02:33,446 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 22:02:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:02:46,089 INFO L93 Difference]: Finished difference Result 135139 states and 167066 transitions. [2019-09-07 22:02:46,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-07 22:02:46,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 754 [2019-09-07 22:02:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:02:46,281 INFO L225 Difference]: With dead ends: 135139 [2019-09-07 22:02:46,281 INFO L226 Difference]: Without dead ends: 77637 [2019-09-07 22:02:46,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8355 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2632, Invalid=18830, Unknown=0, NotChecked=0, Total=21462 [2019-09-07 22:02:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77637 states. [2019-09-07 22:02:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77637 to 75663. [2019-09-07 22:02:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75663 states. [2019-09-07 22:02:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75663 states to 75663 states and 92480 transitions. [2019-09-07 22:02:47,812 INFO L78 Accepts]: Start accepts. Automaton has 75663 states and 92480 transitions. Word has length 754 [2019-09-07 22:02:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:02:47,813 INFO L475 AbstractCegarLoop]: Abstraction has 75663 states and 92480 transitions. [2019-09-07 22:02:47,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:02:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 75663 states and 92480 transitions. [2019-09-07 22:02:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-09-07 22:02:47,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:02:47,883 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:02:47,884 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:02:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:02:47,884 INFO L82 PathProgramCache]: Analyzing trace with hash 659876036, now seen corresponding path program 1 times [2019-09-07 22:02:47,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:02:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:02:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:02:47,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:02:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:02:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:02:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 258 proven. 431 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 22:02:48,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:02:48,622 INFO L223 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-09-07 22:02:48,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:02:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:02:48,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 22:02:48,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:02:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:02:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:02:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:02:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 569 proven. 2 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-07 22:02:49,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:02:49,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 22:02:49,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:02:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:02:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:02:49,375 INFO L87 Difference]: Start difference. First operand 75663 states and 92480 transitions. Second operand 16 states. [2019-09-07 22:05:35,915 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-07 22:05:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:59,372 INFO L93 Difference]: Finished difference Result 200854 states and 275200 transitions. [2019-09-07 22:05:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 22:05:59,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 758 [2019-09-07 22:05:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:59,868 INFO L225 Difference]: With dead ends: 200854 [2019-09-07 22:05:59,868 INFO L226 Difference]: Without dead ends: 122767 [2019-09-07 22:05:59,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 821 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3214 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1240, Invalid=7880, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 22:06:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122767 states. [2019-09-07 22:06:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122767 to 119506. [2019-09-07 22:06:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119506 states. [2019-09-07 22:06:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119506 states to 119506 states and 148824 transitions. [2019-09-07 22:06:02,375 INFO L78 Accepts]: Start accepts. Automaton has 119506 states and 148824 transitions. Word has length 758 [2019-09-07 22:06:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:02,376 INFO L475 AbstractCegarLoop]: Abstraction has 119506 states and 148824 transitions. [2019-09-07 22:06:02,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:06:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 119506 states and 148824 transitions. [2019-09-07 22:06:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2019-09-07 22:06:02,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:02,445 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:06:02,445 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1196723812, now seen corresponding path program 1 times [2019-09-07 22:06:02,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:02,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:02,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:02,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:02,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 492 proven. 61 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:06:05,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:05,482 INFO L223 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-09-07 22:06:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:05,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:06:05,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 492 proven. 61 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 22:06:06,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:06,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 22:06:06,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:06:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:06:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:06:06,712 INFO L87 Difference]: Start difference. First operand 119506 states and 148824 transitions. Second operand 10 states. [2019-09-07 22:06:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:20,540 INFO L93 Difference]: Finished difference Result 270480 states and 333490 transitions. [2019-09-07 22:06:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:06:20,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 778 [2019-09-07 22:06:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:20,940 INFO L225 Difference]: With dead ends: 270480 [2019-09-07 22:06:20,940 INFO L226 Difference]: Without dead ends: 157812 [2019-09-07 22:06:21,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:06:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157812 states. [2019-09-07 22:06:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157812 to 146010. [2019-09-07 22:06:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146010 states. [2019-09-07 22:06:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146010 states to 146010 states and 179804 transitions. [2019-09-07 22:06:23,729 INFO L78 Accepts]: Start accepts. Automaton has 146010 states and 179804 transitions. Word has length 778 [2019-09-07 22:06:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:23,730 INFO L475 AbstractCegarLoop]: Abstraction has 146010 states and 179804 transitions. [2019-09-07 22:06:23,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:06:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 146010 states and 179804 transitions. [2019-09-07 22:06:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2019-09-07 22:06:23,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:23,889 INFO L399 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, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:06:23,890 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1715447214, now seen corresponding path program 1 times [2019-09-07 22:06:23,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 257 proven. 501 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-07 22:06:25,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:25,155 INFO L223 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-09-07 22:06:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 22:06:25,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:25,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:25,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:25,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:06:25,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:06:25,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:06:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 559 proven. 55 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2019-09-07 22:06:28,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:28,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-07 22:06:28,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:06:28,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:06:28,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:06:28,398 INFO L87 Difference]: Start difference. First operand 146010 states and 179804 transitions. Second operand 14 states. [2019-09-07 22:06:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:49,882 INFO L93 Difference]: Finished difference Result 373917 states and 474408 transitions. [2019-09-07 22:06:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 22:06:49,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 843 [2019-09-07 22:06:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:50,598 INFO L225 Difference]: With dead ends: 373917 [2019-09-07 22:06:50,598 INFO L226 Difference]: Without dead ends: 228781 [2019-09-07 22:06:50,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 855 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 22:06:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228781 states. [2019-09-07 22:06:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228781 to 220163. [2019-09-07 22:06:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220163 states. [2019-09-07 22:06:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220163 states to 220163 states and 273290 transitions. [2019-09-07 22:06:57,806 INFO L78 Accepts]: Start accepts. Automaton has 220163 states and 273290 transitions. Word has length 843 [2019-09-07 22:06:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:57,806 INFO L475 AbstractCegarLoop]: Abstraction has 220163 states and 273290 transitions. [2019-09-07 22:06:57,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:06:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 220163 states and 273290 transitions. [2019-09-07 22:06:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2019-09-07 22:06:57,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:57,966 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:06:57,967 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1064224865, now seen corresponding path program 1 times [2019-09-07 22:06:57,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:57,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 577 proven. 61 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 22:06:59,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:59,101 INFO L223 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-09-07 22:06:59,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:59,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:06:59,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 577 proven. 61 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 22:07:00,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 22:07:00,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:07:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:07:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:07:00,327 INFO L87 Difference]: Start difference. First operand 220163 states and 273290 transitions. Second operand 8 states. [2019-09-07 22:07:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:12,993 INFO L93 Difference]: Finished difference Result 434174 states and 537225 transitions. [2019-09-07 22:07:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:07:12,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 865 [2019-09-07 22:07:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:13,721 INFO L225 Difference]: With dead ends: 434174 [2019-09-07 22:07:13,722 INFO L226 Difference]: Without dead ends: 249306 [2019-09-07 22:07:13,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 874 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:07:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249306 states. [2019-09-07 22:07:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249306 to 239213. [2019-09-07 22:07:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239213 states. [2019-09-07 22:07:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239213 states to 239213 states and 294601 transitions. [2019-09-07 22:07:23,356 INFO L78 Accepts]: Start accepts. Automaton has 239213 states and 294601 transitions. Word has length 865 [2019-09-07 22:07:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:23,357 INFO L475 AbstractCegarLoop]: Abstraction has 239213 states and 294601 transitions. [2019-09-07 22:07:23,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:07:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 239213 states and 294601 transitions. [2019-09-07 22:07:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2019-09-07 22:07:23,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:23,560 INFO L399 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:07:23,560 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -284110453, now seen corresponding path program 1 times [2019-09-07 22:07:23,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:23,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:23,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 500 proven. 275 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 22:07:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:24,432 INFO L223 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) [2019-09-07 22:07:24,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:07:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:25,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 22:07:25,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:25,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:25,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:25,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:42,919 WARN L188 SmtUtils]: Spent 11.16 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-07 22:07:46,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 20 proven. 336 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-07 22:07:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:52,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-07 22:07:52,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:07:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:07:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=121, Unknown=4, NotChecked=0, Total=156 [2019-09-07 22:07:52,783 INFO L87 Difference]: Start difference. First operand 239213 states and 294601 transitions. Second operand 13 states. [2019-09-07 22:08:01,152 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2019-09-07 22:08:46,435 WARN L188 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 22:09:12,981 WARN L188 SmtUtils]: Spent 8.08 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-07 22:09:47,523 WARN L188 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 34