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/Problem13_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:01:10,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:01:10,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:01:10,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:01:10,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:01:10,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:01:10,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:01:10,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:01:10,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:01:10,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:01:10,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:01:10,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:01:10,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:01:10,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:01:10,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:01:10,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:01:10,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:01:10,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:01:10,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:01:10,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:01:10,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:01:10,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:01:10,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:01:10,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:01:10,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:01:10,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:01:10,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:01:10,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:01:10,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:01:10,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:01:10,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:01:10,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:01:10,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:01:10,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:01:10,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:01:10,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:01:10,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:01:10,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:01:10,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:01:10,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:01:10,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:01:10,410 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:01:10,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:01:10,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:01:10,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:01:10,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:01:10,426 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:01:10,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:01:10,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:01:10,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:01:10,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:01:10,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:01:10,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:01:10,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:01:10,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:01:10,428 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:01:10,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:01:10,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:01:10,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:01:10,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:01:10,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:01:10,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:01:10,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:01:10,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:01:10,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:01:10,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:01:10,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:01:10,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:01:10,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:01:10,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:01:10,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:01:10,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:01:10,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:01:10,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:01:10,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:01:10,481 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:01:10,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label59.c [2019-09-07 20:01:10,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a0c3e9b/e4c7ffa8a3b642328790ab9489825215/FLAG8959e365c [2019-09-07 20:01:11,321 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:01:11,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label59.c [2019-09-07 20:01:11,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a0c3e9b/e4c7ffa8a3b642328790ab9489825215/FLAG8959e365c [2019-09-07 20:01:11,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a0c3e9b/e4c7ffa8a3b642328790ab9489825215 [2019-09-07 20:01:11,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:01:11,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:01:11,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:01:11,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:01:11,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:01:11,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:01:11" (1/1) ... [2019-09-07 20:01:11,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:11, skipping insertion in model container [2019-09-07 20:01:11,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:01:11" (1/1) ... [2019-09-07 20:01:11,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:01:11,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:01:13,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:01:13,225 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:01:14,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:01:14,068 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:01:14,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14 WrapperNode [2019-09-07 20:01:14,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:01:14,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:01:14,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:01:14,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:01:14,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (1/1) ... [2019-09-07 20:01:14,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:01:14,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:01:14,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:01:14,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:01:14,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (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:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:01:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:01:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 20:01:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 20:01:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:01:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:01:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:01:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:01:21,319 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:01:21,322 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:01:21,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:01:21 BoogieIcfgContainer [2019-09-07 20:01:21,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:01:21,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:01:21,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:01:21,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:01:21,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:01:11" (1/3) ... [2019-09-07 20:01:21,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:01:21, skipping insertion in model container [2019-09-07 20:01:21,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:01:14" (2/3) ... [2019-09-07 20:01:21,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:01:21, skipping insertion in model container [2019-09-07 20:01:21,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:01:21" (3/3) ... [2019-09-07 20:01:21,342 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label59.c [2019-09-07 20:01:21,354 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:01:21,365 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:01:21,383 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:01:21,430 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:01:21,431 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:01:21,431 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:01:21,432 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:01:21,432 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:01:21,432 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:01:21,432 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:01:21,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:01:21,432 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:01:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 20:01:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 20:01:21,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:21,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:01:21,485 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1177685569, now seen corresponding path program 1 times [2019-09-07 20:01:21,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:21,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:21,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:21,874 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:01:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:21,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:01:21,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:01:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:01:21,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:01:21,900 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 4 states. [2019-09-07 20:01:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:32,569 INFO L93 Difference]: Finished difference Result 4061 states and 7602 transitions. [2019-09-07 20:01:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:01:32,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-09-07 20:01:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:32,618 INFO L225 Difference]: With dead ends: 4061 [2019-09-07 20:01:32,618 INFO L226 Difference]: Without dead ends: 2861 [2019-09-07 20:01:32,632 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:01:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-07 20:01:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1910. [2019-09-07 20:01:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-09-07 20:01:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 3427 transitions. [2019-09-07 20:01:32,813 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 3427 transitions. Word has length 52 [2019-09-07 20:01:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:32,815 INFO L475 AbstractCegarLoop]: Abstraction has 1910 states and 3427 transitions. [2019-09-07 20:01:32,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:01:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3427 transitions. [2019-09-07 20:01:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 20:01:32,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:32,832 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:32,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1161124686, now seen corresponding path program 1 times [2019-09-07 20:01:32,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:33,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:33,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:01:33,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:01:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:01:33,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:01:33,098 INFO L87 Difference]: Start difference. First operand 1910 states and 3427 transitions. Second operand 6 states. [2019-09-07 20:01:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:40,950 INFO L93 Difference]: Finished difference Result 5537 states and 10080 transitions. [2019-09-07 20:01:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:01:40,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-07 20:01:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:40,974 INFO L225 Difference]: With dead ends: 5537 [2019-09-07 20:01:40,975 INFO L226 Difference]: Without dead ends: 3633 [2019-09-07 20:01:40,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2019-09-07 20:01:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3606. [2019-09-07 20:01:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3606 states. [2019-09-07 20:01:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 5913 transitions. [2019-09-07 20:01:41,081 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 5913 transitions. Word has length 124 [2019-09-07 20:01:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:41,082 INFO L475 AbstractCegarLoop]: Abstraction has 3606 states and 5913 transitions. [2019-09-07 20:01:41,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:01:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5913 transitions. [2019-09-07 20:01:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 20:01:41,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:41,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:41,086 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1164967785, now seen corresponding path program 1 times [2019-09-07 20:01:41,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:41,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:41,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:41,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:01:41,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:01:41,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:01:41,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:01:41,285 INFO L87 Difference]: Start difference. First operand 3606 states and 5913 transitions. Second operand 5 states. [2019-09-07 20:01:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:50,077 INFO L93 Difference]: Finished difference Result 10894 states and 18432 transitions. [2019-09-07 20:01:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:01:50,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-07 20:01:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:50,121 INFO L225 Difference]: With dead ends: 10894 [2019-09-07 20:01:50,124 INFO L226 Difference]: Without dead ends: 7294 [2019-09-07 20:01:50,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:01:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-09-07 20:01:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7096. [2019-09-07 20:01:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7096 states. [2019-09-07 20:01:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 10799 transitions. [2019-09-07 20:01:50,398 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 10799 transitions. Word has length 150 [2019-09-07 20:01:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:50,401 INFO L475 AbstractCegarLoop]: Abstraction has 7096 states and 10799 transitions. [2019-09-07 20:01:50,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:01:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 10799 transitions. [2019-09-07 20:01:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-07 20:01:50,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:50,404 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:50,404 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash -745696321, now seen corresponding path program 1 times [2019-09-07 20:01:50,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:50,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:01:50,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:01:50,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:01:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:01:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:01:50,611 INFO L87 Difference]: Start difference. First operand 7096 states and 10799 transitions. Second operand 5 states. [2019-09-07 20:02:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:00,637 INFO L93 Difference]: Finished difference Result 21487 states and 34372 transitions. [2019-09-07 20:02:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:02:00,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-07 20:02:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:00,710 INFO L225 Difference]: With dead ends: 21487 [2019-09-07 20:02:00,710 INFO L226 Difference]: Without dead ends: 14397 [2019-09-07 20:02:00,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:02:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14397 states. [2019-09-07 20:02:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14397 to 14161. [2019-09-07 20:02:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14161 states. [2019-09-07 20:02:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14161 states to 14161 states and 21544 transitions. [2019-09-07 20:02:01,106 INFO L78 Accepts]: Start accepts. Automaton has 14161 states and 21544 transitions. Word has length 157 [2019-09-07 20:02:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:01,108 INFO L475 AbstractCegarLoop]: Abstraction has 14161 states and 21544 transitions. [2019-09-07 20:02:01,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:02:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 14161 states and 21544 transitions. [2019-09-07 20:02:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 20:02:01,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:01,114 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:01,114 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1874242283, now seen corresponding path program 1 times [2019-09-07 20:02:01,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:02:01,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:02:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:02:01,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:02:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:02:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:02:01,235 INFO L87 Difference]: Start difference. First operand 14161 states and 21544 transitions. Second operand 3 states. [2019-09-07 20:02:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:06,048 INFO L93 Difference]: Finished difference Result 28318 states and 43244 transitions. [2019-09-07 20:02:06,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:02:06,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-07 20:02:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:06,189 INFO L225 Difference]: With dead ends: 28318 [2019-09-07 20:02:06,189 INFO L226 Difference]: Without dead ends: 14163 [2019-09-07 20:02:06,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:02:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14163 states. [2019-09-07 20:02:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14163 to 14161. [2019-09-07 20:02:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14161 states. [2019-09-07 20:02:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14161 states to 14161 states and 19186 transitions. [2019-09-07 20:02:06,519 INFO L78 Accepts]: Start accepts. Automaton has 14161 states and 19186 transitions. Word has length 167 [2019-09-07 20:02:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:06,519 INFO L475 AbstractCegarLoop]: Abstraction has 14161 states and 19186 transitions. [2019-09-07 20:02:06,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:02:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14161 states and 19186 transitions. [2019-09-07 20:02:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 20:02:06,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:06,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:06,524 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash 14355055, now seen corresponding path program 1 times [2019-09-07 20:02:06,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:06,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:02:06,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:02:06,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:02:06,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:02:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:02:06,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:02:06,675 INFO L87 Difference]: Start difference. First operand 14161 states and 19186 transitions. Second operand 4 states. [2019-09-07 20:02:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:16,452 INFO L93 Difference]: Finished difference Result 49710 states and 72037 transitions. [2019-09-07 20:02:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:02:16,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-07 20:02:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:16,590 INFO L225 Difference]: With dead ends: 49710 [2019-09-07 20:02:16,590 INFO L226 Difference]: Without dead ends: 35555 [2019-09-07 20:02:16,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:02:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35555 states. [2019-09-07 20:02:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35555 to 33931. [2019-09-07 20:02:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33931 states. [2019-09-07 20:02:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33931 states to 33931 states and 46494 transitions. [2019-09-07 20:02:17,610 INFO L78 Accepts]: Start accepts. Automaton has 33931 states and 46494 transitions. Word has length 172 [2019-09-07 20:02:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:17,612 INFO L475 AbstractCegarLoop]: Abstraction has 33931 states and 46494 transitions. [2019-09-07 20:02:17,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:02:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33931 states and 46494 transitions. [2019-09-07 20:02:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 20:02:17,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:17,620 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:02:17,621 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash -551266579, now seen corresponding path program 1 times [2019-09-07 20:02:17,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:17,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:17,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:17,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 90 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:02:17,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:17,846 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:02:17,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:17,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:02:18,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 20:02:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:02:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:02:18,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:02:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:02:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:02:18,236 INFO L87 Difference]: Start difference. First operand 33931 states and 46494 transitions. Second operand 9 states. [2019-09-07 20:02:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:33,827 INFO L93 Difference]: Finished difference Result 109365 states and 163071 transitions. [2019-09-07 20:02:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:02:33,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2019-09-07 20:02:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:34,190 INFO L225 Difference]: With dead ends: 109365 [2019-09-07 20:02:34,190 INFO L226 Difference]: Without dead ends: 75440 [2019-09-07 20:02:34,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:02:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75440 states. [2019-09-07 20:02:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75440 to 75152. [2019-09-07 20:02:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75152 states. [2019-09-07 20:02:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75152 states to 75152 states and 104666 transitions. [2019-09-07 20:02:36,625 INFO L78 Accepts]: Start accepts. Automaton has 75152 states and 104666 transitions. Word has length 248 [2019-09-07 20:02:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:36,626 INFO L475 AbstractCegarLoop]: Abstraction has 75152 states and 104666 transitions. [2019-09-07 20:02:36,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:02:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 75152 states and 104666 transitions. [2019-09-07 20:02:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 20:02:36,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:36,642 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:36,642 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2057893105, now seen corresponding path program 1 times [2019-09-07 20:02:36,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:36,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:02:38,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:02:38,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:02:38,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:02:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:02:38,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:02:38,525 INFO L87 Difference]: Start difference. First operand 75152 states and 104666 transitions. Second operand 6 states. [2019-09-07 20:02:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:52,860 INFO L93 Difference]: Finished difference Result 212562 states and 331750 transitions. [2019-09-07 20:02:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:02:52,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-07 20:02:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:53,959 INFO L225 Difference]: With dead ends: 212562 [2019-09-07 20:02:53,959 INFO L226 Difference]: Without dead ends: 138219 [2019-09-07 20:02:54,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:02:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138219 states. [2019-09-07 20:02:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138219 to 135033. [2019-09-07 20:02:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135033 states. [2019-09-07 20:02:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135033 states to 135033 states and 192692 transitions. [2019-09-07 20:02:57,730 INFO L78 Accepts]: Start accepts. Automaton has 135033 states and 192692 transitions. Word has length 255 [2019-09-07 20:02:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:57,731 INFO L475 AbstractCegarLoop]: Abstraction has 135033 states and 192692 transitions. [2019-09-07 20:02:57,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:02:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 135033 states and 192692 transitions. [2019-09-07 20:02:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-07 20:02:57,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:57,750 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:02:57,751 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash -692566395, now seen corresponding path program 1 times [2019-09-07 20:02:57,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:57,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:57,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:57,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:57,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 137 proven. 36 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-07 20:02:58,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:58,184 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:02:58,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:58,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:02:58,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 20:02:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:02:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:02:58,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:02:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:02:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:02:58,445 INFO L87 Difference]: Start difference. First operand 135033 states and 192692 transitions. Second operand 9 states. [2019-09-07 20:03:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:12,748 INFO L93 Difference]: Finished difference Result 261588 states and 384522 transitions. [2019-09-07 20:03:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:03:12,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 341 [2019-09-07 20:03:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:13,187 INFO L225 Difference]: With dead ends: 261588 [2019-09-07 20:03:13,187 INFO L226 Difference]: Without dead ends: 127364 [2019-09-07 20:03:13,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:03:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127364 states. [2019-09-07 20:03:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127364 to 118243. [2019-09-07 20:03:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118243 states. [2019-09-07 20:03:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118243 states to 118243 states and 147178 transitions. [2019-09-07 20:03:16,191 INFO L78 Accepts]: Start accepts. Automaton has 118243 states and 147178 transitions. Word has length 341 [2019-09-07 20:03:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:16,192 INFO L475 AbstractCegarLoop]: Abstraction has 118243 states and 147178 transitions. [2019-09-07 20:03:16,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:03:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 118243 states and 147178 transitions. [2019-09-07 20:03:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-07 20:03:16,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:16,215 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:16,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1641209747, now seen corresponding path program 1 times [2019-09-07 20:03:16,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:16,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 78 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 20:03:16,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:16,455 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:03:16,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:16,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:03:16,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 360 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 20:03:16,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:16,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:03:16,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:03:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:03:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:03:16,691 INFO L87 Difference]: Start difference. First operand 118243 states and 147178 transitions. Second operand 9 states. [2019-09-07 20:03:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:36,553 INFO L93 Difference]: Finished difference Result 293025 states and 402177 transitions. [2019-09-07 20:03:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:03:36,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 369 [2019-09-07 20:03:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:37,183 INFO L225 Difference]: With dead ends: 293025 [2019-09-07 20:03:37,183 INFO L226 Difference]: Without dead ends: 172302 [2019-09-07 20:03:37,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:03:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172302 states. [2019-09-07 20:03:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172302 to 165477. [2019-09-07 20:03:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165477 states. [2019-09-07 20:03:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165477 states to 165477 states and 222194 transitions. [2019-09-07 20:03:40,959 INFO L78 Accepts]: Start accepts. Automaton has 165477 states and 222194 transitions. Word has length 369 [2019-09-07 20:03:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:40,959 INFO L475 AbstractCegarLoop]: Abstraction has 165477 states and 222194 transitions. [2019-09-07 20:03:40,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:03:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 165477 states and 222194 transitions. [2019-09-07 20:03:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 20:03:40,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:40,996 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:03:40,997 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 704155335, now seen corresponding path program 1 times [2019-09-07 20:03:40,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 230 proven. 117 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:03:41,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:41,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:41,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:41,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:03:41,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:41,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:03:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-07 20:03:41,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:03:41,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:03:41,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:03:41,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:03:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:03:41,715 INFO L87 Difference]: Start difference. First operand 165477 states and 222194 transitions. Second operand 8 states. [2019-09-07 20:04:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:01,737 INFO L93 Difference]: Finished difference Result 406563 states and 549022 transitions. [2019-09-07 20:04:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:04:01,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 399 [2019-09-07 20:04:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:02,542 INFO L225 Difference]: With dead ends: 406563 [2019-09-07 20:04:02,542 INFO L226 Difference]: Without dead ends: 241895 [2019-09-07 20:04:03,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:04:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241895 states. [2019-09-07 20:04:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241895 to 236128. [2019-09-07 20:04:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236128 states. [2019-09-07 20:04:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236128 states to 236128 states and 314471 transitions. [2019-09-07 20:04:11,719 INFO L78 Accepts]: Start accepts. Automaton has 236128 states and 314471 transitions. Word has length 399 [2019-09-07 20:04:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:11,720 INFO L475 AbstractCegarLoop]: Abstraction has 236128 states and 314471 transitions. [2019-09-07 20:04:11,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:04:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 236128 states and 314471 transitions. [2019-09-07 20:04:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-09-07 20:04:11,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:11,751 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:04:11,752 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1028013305, now seen corresponding path program 1 times [2019-09-07 20:04:11,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:11,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 573 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 20:04:12,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:12,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:04:12,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:12,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:04:12,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 573 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 20:04:12,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:12,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:04:12,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:04:12,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:04:12,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:04:12,448 INFO L87 Difference]: Start difference. First operand 236128 states and 314471 transitions. Second operand 9 states. [2019-09-07 20:04:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:35,571 INFO L93 Difference]: Finished difference Result 488680 states and 714757 transitions. [2019-09-07 20:04:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 20:04:35,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 512 [2019-09-07 20:04:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:36,595 INFO L225 Difference]: With dead ends: 488680 [2019-09-07 20:04:36,595 INFO L226 Difference]: Without dead ends: 251680 [2019-09-07 20:04:37,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:04:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251680 states. [2019-09-07 20:04:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251680 to 248973. [2019-09-07 20:04:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248973 states. [2019-09-07 20:04:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248973 states to 248973 states and 351278 transitions. [2019-09-07 20:04:43,032 INFO L78 Accepts]: Start accepts. Automaton has 248973 states and 351278 transitions. Word has length 512 [2019-09-07 20:04:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:43,033 INFO L475 AbstractCegarLoop]: Abstraction has 248973 states and 351278 transitions. [2019-09-07 20:04:43,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:04:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 248973 states and 351278 transitions. [2019-09-07 20:04:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-09-07 20:04:43,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:43,066 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:04:43,066 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1371488533, now seen corresponding path program 1 times [2019-09-07 20:04:43,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 75 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:04:43,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:43,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:04:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:43,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:04:43,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 20:04:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:04:49,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 20:04:49,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:04:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:04:49,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:04:49,020 INFO L87 Difference]: Start difference. First operand 248973 states and 351278 transitions. Second operand 9 states. [2019-09-07 20:05:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:10,611 INFO L93 Difference]: Finished difference Result 497730 states and 655029 transitions. [2019-09-07 20:05:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:05:10,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 551 [2019-09-07 20:05:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:11,459 INFO L225 Difference]: With dead ends: 497730 [2019-09-07 20:05:11,460 INFO L226 Difference]: Without dead ends: 247090 [2019-09-07 20:05:11,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:05:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247090 states. [2019-09-07 20:05:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247090 to 242403. [2019-09-07 20:05:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242403 states. [2019-09-07 20:05:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242403 states to 242403 states and 265786 transitions. [2019-09-07 20:05:16,673 INFO L78 Accepts]: Start accepts. Automaton has 242403 states and 265786 transitions. Word has length 551 [2019-09-07 20:05:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:16,674 INFO L475 AbstractCegarLoop]: Abstraction has 242403 states and 265786 transitions. [2019-09-07 20:05:16,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:05:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 242403 states and 265786 transitions. [2019-09-07 20:05:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2019-09-07 20:05:16,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:16,709 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:05:16,710 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash 274648806, now seen corresponding path program 1 times [2019-09-07 20:05:16,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 329 proven. 633 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-07 20:05:21,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:05:21,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:05:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:21,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:05:21,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:05:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 866 proven. 2 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-09-07 20:05:22,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:05:22,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 20:05:22,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:05:22,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:05:22,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:05:22,220 INFO L87 Difference]: Start difference. First operand 242403 states and 265786 transitions. Second operand 12 states. [2019-09-07 20:05:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:55,015 INFO L93 Difference]: Finished difference Result 569359 states and 627218 transitions. [2019-09-07 20:05:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:05:55,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 686 [2019-09-07 20:05:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:56,531 INFO L225 Difference]: With dead ends: 569359 [2019-09-07 20:05:56,531 INFO L226 Difference]: Without dead ends: 329392 [2019-09-07 20:05:56,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 20:05:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329392 states. [2019-09-07 20:06:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329392 to 323008. [2019-09-07 20:06:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323008 states. [2019-09-07 20:06:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323008 states to 323008 states and 355010 transitions. [2019-09-07 20:06:06,956 INFO L78 Accepts]: Start accepts. Automaton has 323008 states and 355010 transitions. Word has length 686 [2019-09-07 20:06:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:06,956 INFO L475 AbstractCegarLoop]: Abstraction has 323008 states and 355010 transitions. [2019-09-07 20:06:06,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:06:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 323008 states and 355010 transitions. [2019-09-07 20:06:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2019-09-07 20:06:07,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:07,027 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:06:07,028 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash 515312915, now seen corresponding path program 1 times [2019-09-07 20:06:07,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:07,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:07,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2198 backedges. 451 proven. 456 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-09-07 20:06:08,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:08,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:06:08,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:08,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 20:06:08,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2198 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [2019-09-07 20:06:09,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:06:09,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 20:06:09,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:06:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:06:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:06:09,012 INFO L87 Difference]: Start difference. First operand 323008 states and 355010 transitions. Second operand 8 states. [2019-09-07 20:06:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:32,645 INFO L93 Difference]: Finished difference Result 803111 states and 885372 transitions. [2019-09-07 20:06:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:06:32,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 769 [2019-09-07 20:06:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:34,811 INFO L225 Difference]: With dead ends: 803111 [2019-09-07 20:06:34,811 INFO L226 Difference]: Without dead ends: 476727 [2019-09-07 20:06:35,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:06:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476727 states. [2019-09-07 20:06:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476727 to 460573. [2019-09-07 20:06:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460573 states. [2019-09-07 20:06:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460573 states to 460573 states and 502355 transitions. [2019-09-07 20:06:47,990 INFO L78 Accepts]: Start accepts. Automaton has 460573 states and 502355 transitions. Word has length 769 [2019-09-07 20:06:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:47,990 INFO L475 AbstractCegarLoop]: Abstraction has 460573 states and 502355 transitions. [2019-09-07 20:06:47,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:06:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 460573 states and 502355 transitions. [2019-09-07 20:06:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-09-07 20:06:48,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:48,042 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 20:06:48,042 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1376862958, now seen corresponding path program 1 times [2019-09-07 20:06:48,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:48,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 353 proven. 884 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-09-07 20:06:54,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:54,687 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) [2019-09-07 20:06:54,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:06:54,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 1067 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-07 20:06:55,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:55,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 20:06:55,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:06:55,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:06:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:06:55,422 INFO L87 Difference]: Start difference. First operand 460573 states and 502355 transitions. Second operand 16 states. [2019-09-07 20:07:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:43,168 INFO L93 Difference]: Finished difference Result 835454 states and 913072 transitions. [2019-09-07 20:07:43,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 20:07:43,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 780 [2019-09-07 20:07:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:44,556 INFO L225 Difference]: With dead ends: 835454 [2019-09-07 20:07:44,556 INFO L226 Difference]: Without dead ends: 495324 [2019-09-07 20:07:44,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 860 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4800 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1775, Invalid=10657, Unknown=0, NotChecked=0, Total=12432 [2019-09-07 20:07:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495324 states. [2019-09-07 20:07:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495324 to 485142. [2019-09-07 20:07:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485142 states. [2019-09-07 20:07:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485142 states to 485142 states and 526938 transitions. [2019-09-07 20:07:55,982 INFO L78 Accepts]: Start accepts. Automaton has 485142 states and 526938 transitions. Word has length 780 [2019-09-07 20:07:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:55,983 INFO L475 AbstractCegarLoop]: Abstraction has 485142 states and 526938 transitions. [2019-09-07 20:07:55,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:07:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 485142 states and 526938 transitions. [2019-09-07 20:07:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2019-09-07 20:07:56,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:56,043 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:07:56,043 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash -267350029, now seen corresponding path program 1 times [2019-09-07 20:07:56,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:56,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:56,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1359 proven. 83 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-09-07 20:08:03,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:03,357 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:08:03,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:03,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:08:03,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:03,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:08:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 1053 proven. 2 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-09-07 20:08:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-07 20:08:04,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:08:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:08:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:08:04,120 INFO L87 Difference]: Start difference. First operand 485142 states and 526938 transitions. Second operand 17 states. [2019-09-07 20:09:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:21,965 INFO L93 Difference]: Finished difference Result 1112079 states and 1273317 transitions. [2019-09-07 20:09:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-07 20:09:21,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 845 [2019-09-07 20:09:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:24,868 INFO L225 Difference]: With dead ends: 1112079 [2019-09-07 20:09:24,868 INFO L226 Difference]: Without dead ends: 625164 [2019-09-07 20:09:25,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9455 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2489, Invalid=20767, Unknown=0, NotChecked=0, Total=23256 [2019-09-07 20:09:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625164 states. [2019-09-07 20:09:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625164 to 593755. [2019-09-07 20:09:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593755 states. [2019-09-07 20:09:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593755 states to 593755 states and 653501 transitions. [2019-09-07 20:09:53,393 INFO L78 Accepts]: Start accepts. Automaton has 593755 states and 653501 transitions. Word has length 845 [2019-09-07 20:09:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:53,393 INFO L475 AbstractCegarLoop]: Abstraction has 593755 states and 653501 transitions. [2019-09-07 20:09:53,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:09:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 593755 states and 653501 transitions. [2019-09-07 20:09:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2019-09-07 20:09:53,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:53,426 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:53,426 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -680168514, now seen corresponding path program 1 times [2019-09-07 20:09:53,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:53,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:53,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 577 proven. 209 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-09-07 20:09:56,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:56,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:09:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:56,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:09:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:56,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:10:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 974 proven. 12 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-09-07 20:10:01,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:10:01,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2019-09-07 20:10:01,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:10:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:10:01,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:10:01,973 INFO L87 Difference]: Start difference. First operand 593755 states and 653501 transitions. Second operand 11 states. [2019-09-07 20:10:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:10:34,048 INFO L93 Difference]: Finished difference Result 1266427 states and 1460265 transitions. [2019-09-07 20:10:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:10:34,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 916 [2019-09-07 20:10:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:10:36,178 INFO L225 Difference]: With dead ends: 1266427 [2019-09-07 20:10:36,178 INFO L226 Difference]: Without dead ends: 689655 [2019-09-07 20:10:36,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 921 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:10:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689655 states. [2019-09-07 20:10:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689655 to 662004. [2019-09-07 20:10:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662004 states. [2019-09-07 20:11:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662004 states to 662004 states and 718886 transitions. [2019-09-07 20:11:09,269 INFO L78 Accepts]: Start accepts. Automaton has 662004 states and 718886 transitions. Word has length 916 [2019-09-07 20:11:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:11:09,270 INFO L475 AbstractCegarLoop]: Abstraction has 662004 states and 718886 transitions. [2019-09-07 20:11:09,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:11:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 662004 states and 718886 transitions. [2019-09-07 20:11:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2019-09-07 20:11:09,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:11:09,435 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:09,436 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:11:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:11:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1599100670, now seen corresponding path program 1 times [2019-09-07 20:11:09,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:11:09,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:11:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:09,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:09,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:11:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 810 proven. 2 refuted. 0 times theorem prover too weak. 1368 trivial. 0 not checked. [2019-09-07 20:11:12,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:11:12,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:11:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:11:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:11:12,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:11:12,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:11:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:11:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:11:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 1526 proven. 2 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-09-07 20:11:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:11:13,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 20:11:13,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:11:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:11:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:11:13,765 INFO L87 Difference]: Start difference. First operand 662004 states and 718886 transitions. Second operand 10 states. [2019-09-07 20:11:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:11:52,718 INFO L93 Difference]: Finished difference Result 1393687 states and 1519829 transitions. [2019-09-07 20:11:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 20:11:52,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1250 [2019-09-07 20:11:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:11:54,540 INFO L225 Difference]: With dead ends: 1393687 [2019-09-07 20:11:54,540 INFO L226 Difference]: Without dead ends: 748662 [2019-09-07 20:11:55,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1358 GetRequests, 1297 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=642, Invalid=3264, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 20:11:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748662 states.