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/Problem15_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:28:24,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:28:24,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:28:24,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:28:24,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:28:24,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:28:24,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:28:24,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:28:24,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:28:24,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:28:24,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:28:24,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:28:24,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:28:24,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:28:24,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:28:24,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:28:24,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:28:24,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:28:24,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:28:24,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:28:24,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:28:24,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:28:24,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:28:24,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:28:24,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:28:24,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:28:24,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:28:24,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:28:24,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:28:24,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:28:24,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:28:24,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:28:24,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:28:24,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:28:24,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:28:24,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:28:24,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:28:24,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:28:24,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:28:24,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:28:24,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:28:24,051 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 20:28:24,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:28:24,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:28:24,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:28:24,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:28:24,068 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:28:24,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:28:24,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:28:24,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:28:24,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:28:24,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:28:24,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:28:24,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:28:24,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:28:24,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:28:24,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:28:24,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:28:24,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:28:24,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:28:24,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:28:24,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:28:24,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:28:24,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:28:24,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:28:24,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:28:24,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:28:24,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:28:24,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:28:24,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:28:24,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:28:24,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:28:24,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:28:24,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:28:24,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:28:24,120 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:28:24,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label18.c [2019-09-07 20:28:24,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d183e72/2d274836c166469b830ce1ecc82f7629/FLAG1ef070146 [2019-09-07 20:28:24,842 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:28:24,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label18.c [2019-09-07 20:28:24,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d183e72/2d274836c166469b830ce1ecc82f7629/FLAG1ef070146 [2019-09-07 20:28:24,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d183e72/2d274836c166469b830ce1ecc82f7629 [2019-09-07 20:28:25,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:28:25,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:28:25,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:28:25,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:28:25,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:28:25,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:28:24" (1/1) ... [2019-09-07 20:28:25,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fabe5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:25, skipping insertion in model container [2019-09-07 20:28:25,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:28:24" (1/1) ... [2019-09-07 20:28:25,031 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:28:25,127 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:28:26,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:28:26,068 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:28:26,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:28:26,347 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:28:26,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26 WrapperNode [2019-09-07 20:28:26,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:28:26,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:28:26,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:28:26,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:28:26,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (1/1) ... [2019-09-07 20:28:26,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:28:26,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:28:26,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:28:26,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:28:26,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (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 20:28:26,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:28:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:28:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:28:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:28:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:28:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:28:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:28:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:28:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:28:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:28:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:28:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:28:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:28:30,023 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:28:30,024 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:28:30,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:28:30 BoogieIcfgContainer [2019-09-07 20:28:30,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:28:30,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:28:30,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:28:30,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:28:30,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:28:24" (1/3) ... [2019-09-07 20:28:30,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dad1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:28:30, skipping insertion in model container [2019-09-07 20:28:30,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:28:26" (2/3) ... [2019-09-07 20:28:30,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dad1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:28:30, skipping insertion in model container [2019-09-07 20:28:30,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:28:30" (3/3) ... [2019-09-07 20:28:30,034 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label18.c [2019-09-07 20:28:30,046 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:28:30,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:28:30,075 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:28:30,117 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:28:30,118 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:28:30,119 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:28:30,119 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:28:30,119 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:28:30,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:28:30,119 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:28:30,119 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:28:30,120 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:28:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:28:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 20:28:30,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:30,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:28:30,170 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash -499099328, now seen corresponding path program 1 times [2019-09-07 20:28:30,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:30,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:30,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:30,424 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 20:28:30,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:28:30,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:28:30,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:28:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:28:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:28:30,451 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:28:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:28:36,197 INFO L93 Difference]: Finished difference Result 1510 states and 2773 transitions. [2019-09-07 20:28:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:28:36,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-07 20:28:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:28:36,226 INFO L225 Difference]: With dead ends: 1510 [2019-09-07 20:28:36,227 INFO L226 Difference]: Without dead ends: 1006 [2019-09-07 20:28:36,239 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 20:28:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-07 20:28:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1004. [2019-09-07 20:28:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-09-07 20:28:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1509 transitions. [2019-09-07 20:28:36,362 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1509 transitions. Word has length 14 [2019-09-07 20:28:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:28:36,362 INFO L475 AbstractCegarLoop]: Abstraction has 1004 states and 1509 transitions. [2019-09-07 20:28:36,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:28:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1509 transitions. [2019-09-07 20:28:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 20:28:36,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:36,368 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:28:36,369 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1852878916, now seen corresponding path program 1 times [2019-09-07 20:28:36,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:36,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:28:36,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:28:36,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:28:36,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:28:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:28:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:28:36,588 INFO L87 Difference]: Start difference. First operand 1004 states and 1509 transitions. Second operand 3 states. [2019-09-07 20:28:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:28:38,890 INFO L93 Difference]: Finished difference Result 2928 states and 4443 transitions. [2019-09-07 20:28:38,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:28:38,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-07 20:28:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:28:38,903 INFO L225 Difference]: With dead ends: 2928 [2019-09-07 20:28:38,904 INFO L226 Difference]: Without dead ends: 1930 [2019-09-07 20:28:38,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:28:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-07 20:28:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-07 20:28:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-07 20:28:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2555 transitions. [2019-09-07 20:28:38,973 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2555 transitions. Word has length 83 [2019-09-07 20:28:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:28:38,975 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2555 transitions. [2019-09-07 20:28:38,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:28:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2555 transitions. [2019-09-07 20:28:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 20:28:38,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:38,992 INFO L399 BasicCegarLoop]: trace histogram [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, 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 20:28:38,992 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash 164497567, now seen corresponding path program 1 times [2019-09-07 20:28:38,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 20:28:39,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:28:39,481 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:28:39,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:39,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:28:39,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:28:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:28:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:28:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:28:39,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:28:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:28:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:28:39,745 INFO L87 Difference]: Start difference. First operand 1928 states and 2555 transitions. Second operand 7 states. [2019-09-07 20:28:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:28:45,721 INFO L93 Difference]: Finished difference Result 5786 states and 7748 transitions. [2019-09-07 20:28:45,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:28:45,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-09-07 20:28:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:28:45,743 INFO L225 Difference]: With dead ends: 5786 [2019-09-07 20:28:45,743 INFO L226 Difference]: Without dead ends: 3864 [2019-09-07 20:28:45,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:28:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-09-07 20:28:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3832. [2019-09-07 20:28:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2019-09-07 20:28:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4718 transitions. [2019-09-07 20:28:45,888 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4718 transitions. Word has length 192 [2019-09-07 20:28:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:28:45,890 INFO L475 AbstractCegarLoop]: Abstraction has 3832 states and 4718 transitions. [2019-09-07 20:28:45,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:28:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4718 transitions. [2019-09-07 20:28:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-07 20:28:45,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:45,895 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:45,895 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 793272647, now seen corresponding path program 1 times [2019-09-07 20:28:45,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:45,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:45,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:28:46,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:28:46,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:28:46,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:28:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:28:46,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:28:46,169 INFO L87 Difference]: Start difference. First operand 3832 states and 4718 transitions. Second operand 3 states. [2019-09-07 20:28:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:28:48,446 INFO L93 Difference]: Finished difference Result 9519 states and 12094 transitions. [2019-09-07 20:28:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:28:48,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-07 20:28:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:28:48,481 INFO L225 Difference]: With dead ends: 9519 [2019-09-07 20:28:48,481 INFO L226 Difference]: Without dead ends: 5693 [2019-09-07 20:28:48,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:28:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-09-07 20:28:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5693. [2019-09-07 20:28:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5693 states. [2019-09-07 20:28:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 6796 transitions. [2019-09-07 20:28:48,650 INFO L78 Accepts]: Start accepts. Automaton has 5693 states and 6796 transitions. Word has length 294 [2019-09-07 20:28:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:28:48,654 INFO L475 AbstractCegarLoop]: Abstraction has 5693 states and 6796 transitions. [2019-09-07 20:28:48,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:28:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5693 states and 6796 transitions. [2019-09-07 20:28:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 20:28:48,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:48,660 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:48,661 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -701591683, now seen corresponding path program 1 times [2019-09-07 20:28:48,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:48,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:48,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:28:49,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:28:49,025 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 20:28:49,043 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 20:28:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:49,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:28:49,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:28:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:28:49,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:28:49,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:28:49,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:28:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:28:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:28:49,371 INFO L87 Difference]: Start difference. First operand 5693 states and 6796 transitions. Second operand 9 states. [2019-09-07 20:28:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:28:57,179 INFO L93 Difference]: Finished difference Result 17004 states and 22414 transitions. [2019-09-07 20:28:57,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:28:57,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-07 20:28:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:28:57,255 INFO L225 Difference]: With dead ends: 17004 [2019-09-07 20:28:57,255 INFO L226 Difference]: Without dead ends: 11317 [2019-09-07 20:28:57,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:28:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11317 states. [2019-09-07 20:28:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11317 to 9425. [2019-09-07 20:28:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9425 states. [2019-09-07 20:28:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9425 states to 9425 states and 12350 transitions. [2019-09-07 20:28:57,630 INFO L78 Accepts]: Start accepts. Automaton has 9425 states and 12350 transitions. Word has length 300 [2019-09-07 20:28:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:28:57,631 INFO L475 AbstractCegarLoop]: Abstraction has 9425 states and 12350 transitions. [2019-09-07 20:28:57,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:28:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9425 states and 12350 transitions. [2019-09-07 20:28:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-07 20:28:57,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:28:57,642 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:28:57,642 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:28:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:28:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -200405847, now seen corresponding path program 1 times [2019-09-07 20:28:57,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:28:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:28:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:28:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 147 proven. 83 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 20:28:58,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:28:58,206 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 20:28:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:28:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:28:58,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:28:58,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:28:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:28:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 20:28:58,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:28:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:28:58,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:28:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:28:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:28:58,752 INFO L87 Difference]: Start difference. First operand 9425 states and 12350 transitions. Second operand 9 states. [2019-09-07 20:29:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:08,477 INFO L93 Difference]: Finished difference Result 28624 states and 42058 transitions. [2019-09-07 20:29:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:29:08,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 423 [2019-09-07 20:29:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:08,609 INFO L225 Difference]: With dead ends: 28624 [2019-09-07 20:29:08,609 INFO L226 Difference]: Without dead ends: 19205 [2019-09-07 20:29:08,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:29:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2019-09-07 20:29:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 17905. [2019-09-07 20:29:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17905 states. [2019-09-07 20:29:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17905 states to 17905 states and 26386 transitions. [2019-09-07 20:29:09,437 INFO L78 Accepts]: Start accepts. Automaton has 17905 states and 26386 transitions. Word has length 423 [2019-09-07 20:29:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:09,438 INFO L475 AbstractCegarLoop]: Abstraction has 17905 states and 26386 transitions. [2019-09-07 20:29:09,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:29:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 17905 states and 26386 transitions. [2019-09-07 20:29:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-07 20:29:09,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:09,455 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:09,456 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash -834721206, now seen corresponding path program 1 times [2019-09-07 20:29:09,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:09,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 147 proven. 83 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 20:29:09,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:09,935 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) [2019-09-07 20:29:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:29:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:10,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:29:10,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 301 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:29:11,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:29:11,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:29:11,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:29:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:29:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:29:11,012 INFO L87 Difference]: Start difference. First operand 17905 states and 26386 transitions. Second operand 9 states. [2019-09-07 20:29:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:17,092 INFO L93 Difference]: Finished difference Result 37693 states and 65585 transitions. [2019-09-07 20:29:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:29:17,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 509 [2019-09-07 20:29:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:17,239 INFO L225 Difference]: With dead ends: 37693 [2019-09-07 20:29:17,239 INFO L226 Difference]: Without dead ends: 20101 [2019-09-07 20:29:17,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:29:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20101 states. [2019-09-07 20:29:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20101 to 20076. [2019-09-07 20:29:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20076 states. [2019-09-07 20:29:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20076 states to 20076 states and 37795 transitions. [2019-09-07 20:29:18,437 INFO L78 Accepts]: Start accepts. Automaton has 20076 states and 37795 transitions. Word has length 509 [2019-09-07 20:29:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:18,438 INFO L475 AbstractCegarLoop]: Abstraction has 20076 states and 37795 transitions. [2019-09-07 20:29:18,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:29:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20076 states and 37795 transitions. [2019-09-07 20:29:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-09-07 20:29:18,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:18,458 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:18,458 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1513259227, now seen corresponding path program 1 times [2019-09-07 20:29:18,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 267 proven. 2 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-07 20:29:19,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:19,140 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) [2019-09-07 20:29:19,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:29:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:19,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:29:19,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 267 proven. 2 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-09-07 20:29:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:29:19,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:29:19,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:29:19,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:29:19,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:29:19,485 INFO L87 Difference]: Start difference. First operand 20076 states and 37795 transitions. Second operand 7 states. [2019-09-07 20:29:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:23,264 INFO L93 Difference]: Finished difference Result 43955 states and 85028 transitions. [2019-09-07 20:29:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:29:23,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 551 [2019-09-07 20:29:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:23,458 INFO L225 Difference]: With dead ends: 43955 [2019-09-07 20:29:23,459 INFO L226 Difference]: Without dead ends: 24192 [2019-09-07 20:29:23,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:29:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24192 states. [2019-09-07 20:29:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24192 to 23003. [2019-09-07 20:29:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23003 states. [2019-09-07 20:29:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23003 states to 23003 states and 41173 transitions. [2019-09-07 20:29:26,184 INFO L78 Accepts]: Start accepts. Automaton has 23003 states and 41173 transitions. Word has length 551 [2019-09-07 20:29:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:26,185 INFO L475 AbstractCegarLoop]: Abstraction has 23003 states and 41173 transitions. [2019-09-07 20:29:26,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:29:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 23003 states and 41173 transitions. [2019-09-07 20:29:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-07 20:29:26,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:26,206 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2019-09-07 20:29:26,207 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1740581788, now seen corresponding path program 1 times [2019-09-07 20:29:26,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:26,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:26,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 129 proven. 205 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-09-07 20:29:27,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:27,134 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) [2019-09-07 20:29:27,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:29:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:27,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 20:29:27,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:29:27,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:29:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 451 proven. 41 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:29:28,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:29:28,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 20:29:28,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:29:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:29:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:29:28,110 INFO L87 Difference]: Start difference. First operand 23003 states and 41173 transitions. Second operand 13 states. [2019-09-07 20:29:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:44,327 INFO L93 Difference]: Finished difference Result 67999 states and 127212 transitions. [2019-09-07 20:29:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 20:29:44,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 569 [2019-09-07 20:29:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:44,551 INFO L225 Difference]: With dead ends: 67999 [2019-09-07 20:29:44,553 INFO L226 Difference]: Without dead ends: 37684 [2019-09-07 20:29:44,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1028, Invalid=4374, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 20:29:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37684 states. [2019-09-07 20:29:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37684 to 26732. [2019-09-07 20:29:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26732 states. [2019-09-07 20:29:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26732 states to 26732 states and 40490 transitions. [2019-09-07 20:29:45,958 INFO L78 Accepts]: Start accepts. Automaton has 26732 states and 40490 transitions. Word has length 569 [2019-09-07 20:29:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:45,959 INFO L475 AbstractCegarLoop]: Abstraction has 26732 states and 40490 transitions. [2019-09-07 20:29:45,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:29:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26732 states and 40490 transitions. [2019-09-07 20:29:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-07 20:29:45,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:45,980 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:29:45,981 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1207566462, now seen corresponding path program 1 times [2019-09-07 20:29:45,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:45,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:45,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:45,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:45,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-07 20:29:46,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:46,667 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) [2019-09-07 20:29:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:29:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:46,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:29:46,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-09-07 20:29:47,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:29:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:29:47,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:29:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:29:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:29:47,203 INFO L87 Difference]: Start difference. First operand 26732 states and 40490 transitions. Second operand 3 states. [2019-09-07 20:29:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:49,249 INFO L93 Difference]: Finished difference Result 51907 states and 79260 transitions. [2019-09-07 20:29:49,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:29:49,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-09-07 20:29:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:49,382 INFO L225 Difference]: With dead ends: 51907 [2019-09-07 20:29:49,383 INFO L226 Difference]: Without dead ends: 27047 [2019-09-07 20:29:49,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:29:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2019-09-07 20:29:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 26728. [2019-09-07 20:29:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26728 states. [2019-09-07 20:29:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26728 states to 26728 states and 40399 transitions. [2019-09-07 20:29:50,310 INFO L78 Accepts]: Start accepts. Automaton has 26728 states and 40399 transitions. Word has length 609 [2019-09-07 20:29:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:50,311 INFO L475 AbstractCegarLoop]: Abstraction has 26728 states and 40399 transitions. [2019-09-07 20:29:50,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:29:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 26728 states and 40399 transitions. [2019-09-07 20:29:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-07 20:29:50,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:50,323 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:29:50,323 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1736015616, now seen corresponding path program 1 times [2019-09-07 20:29:50,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:50,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 274 proven. 82 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-07 20:29:51,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:51,027 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 20:29:51,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:51,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:29:51,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:51,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:29:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 504 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 20:29:51,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:29:51,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:29:51,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:29:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:29:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:29:51,735 INFO L87 Difference]: Start difference. First operand 26728 states and 40399 transitions. Second operand 7 states. [2019-09-07 20:29:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:29:56,454 INFO L93 Difference]: Finished difference Result 56959 states and 89784 transitions. [2019-09-07 20:29:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:29:56,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 609 [2019-09-07 20:29:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:29:56,615 INFO L225 Difference]: With dead ends: 56959 [2019-09-07 20:29:56,616 INFO L226 Difference]: Without dead ends: 28803 [2019-09-07 20:29:56,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:29:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28803 states. [2019-09-07 20:29:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28803 to 28651. [2019-09-07 20:29:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28651 states. [2019-09-07 20:29:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28651 states to 28651 states and 42208 transitions. [2019-09-07 20:29:57,362 INFO L78 Accepts]: Start accepts. Automaton has 28651 states and 42208 transitions. Word has length 609 [2019-09-07 20:29:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:29:57,363 INFO L475 AbstractCegarLoop]: Abstraction has 28651 states and 42208 transitions. [2019-09-07 20:29:57,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:29:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 28651 states and 42208 transitions. [2019-09-07 20:29:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-09-07 20:29:57,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:29:57,371 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:29:57,371 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:29:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:29:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash -457809810, now seen corresponding path program 1 times [2019-09-07 20:29:57,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:29:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:29:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:29:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2019-09-07 20:29:57,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:29:57,796 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 20:29:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:29:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:29:57,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:29:57,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:29:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 20:29:58,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:29:58,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:29:58,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:29:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:29:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:29:58,572 INFO L87 Difference]: Start difference. First operand 28651 states and 42208 transitions. Second operand 3 states. [2019-09-07 20:30:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:30:00,800 INFO L93 Difference]: Finished difference Result 59975 states and 88291 transitions. [2019-09-07 20:30:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:30:00,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 649 [2019-09-07 20:30:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:30:00,977 INFO L225 Difference]: With dead ends: 59975 [2019-09-07 20:30:00,977 INFO L226 Difference]: Without dead ends: 33511 [2019-09-07 20:30:01,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 649 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 20:30:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33511 states. [2019-09-07 20:30:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33511 to 28289. [2019-09-07 20:30:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28289 states. [2019-09-07 20:30:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28289 states to 28289 states and 41560 transitions. [2019-09-07 20:30:01,807 INFO L78 Accepts]: Start accepts. Automaton has 28289 states and 41560 transitions. Word has length 649 [2019-09-07 20:30:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:30:01,808 INFO L475 AbstractCegarLoop]: Abstraction has 28289 states and 41560 transitions. [2019-09-07 20:30:01,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:30:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28289 states and 41560 transitions. [2019-09-07 20:30:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-09-07 20:30:01,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:30:01,819 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:30:01,820 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:30:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:30:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 87648060, now seen corresponding path program 1 times [2019-09-07 20:30:01,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:30:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:30:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:30:03,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:30:03,369 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:30:03,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:03,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:30:03,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:30:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:03,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:25,469 WARN L188 SmtUtils]: Spent 21.73 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-07 20:30:27,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:30:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-09-07 20:30:28,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:30:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-09-07 20:30:28,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:30:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:30:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:30:28,308 INFO L87 Difference]: Start difference. First operand 28289 states and 41560 transitions. Second operand 16 states.