java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:10:52,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:10:52,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:10:52,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:10:52,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:10:52,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:10:52,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:10:52,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:10:52,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:10:52,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:10:52,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:10:52,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:10:52,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:10:52,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:10:52,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:10:52,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:10:52,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:10:52,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:10:52,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:10:52,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:10:52,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:10:52,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:10:52,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:10:52,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:10:52,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:10:52,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:10:52,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:10:52,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:10:52,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:10:52,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:10:52,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:10:52,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:10:52,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:10:52,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:10:52,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:10:52,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:10:52,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:10:52,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:10:52,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:10:52,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:10:52,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:10:52,408 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 19:10:52,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:10:52,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:10:52,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:10:52,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:10:52,433 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:10:52,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:10:52,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:10:52,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:10:52,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:10:52,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:10:52,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:10:52,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:10:52,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:10:52,436 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:10:52,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:10:52,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:10:52,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:10:52,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:10:52,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:10:52,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:10:52,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:10:52,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:10:52,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:10:52,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:10:52,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:10:52,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:10:52,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:10:52,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:10:52,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:10:52,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:10:52,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:10:52,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:10:52,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:10:52,517 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:10:52,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label54.c [2019-09-07 19:10:52,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9ad0c35/05972e21bf9941e980ef40aaec37932e/FLAGbad4a0e15 [2019-09-07 19:10:53,356 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:10:53,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label54.c [2019-09-07 19:10:53,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9ad0c35/05972e21bf9941e980ef40aaec37932e/FLAGbad4a0e15 [2019-09-07 19:10:53,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9ad0c35/05972e21bf9941e980ef40aaec37932e [2019-09-07 19:10:53,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:10:53,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:10:53,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:10:53,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:10:53,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:10:53,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:10:53" (1/1) ... [2019-09-07 19:10:53,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b684b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:53, skipping insertion in model container [2019-09-07 19:10:53,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:10:53" (1/1) ... [2019-09-07 19:10:53,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:10:53,644 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:10:55,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:10:55,192 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:10:55,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:10:55,942 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:10:55,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55 WrapperNode [2019-09-07 19:10:55,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:10:55,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:10:55,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:10:55,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:10:55,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:55,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (1/1) ... [2019-09-07 19:10:56,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:10:56,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:10:56,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:10:56,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:10:56,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (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 19:10:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:10:56,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:10:56,304 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:10:56,304 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:10:56,304 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:10:56,304 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:10:56,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:10:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:10:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:10:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:10:56,305 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:10:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:10:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:10:56,306 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:10:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:10:56,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:10:56,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:11:01,187 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:11:01,187 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:11:01,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:11:01 BoogieIcfgContainer [2019-09-07 19:11:01,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:11:01,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:11:01,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:11:01,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:11:01,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:10:53" (1/3) ... [2019-09-07 19:11:01,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4343e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:11:01, skipping insertion in model container [2019-09-07 19:11:01,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:10:55" (2/3) ... [2019-09-07 19:11:01,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4343e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:11:01, skipping insertion in model container [2019-09-07 19:11:01,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:11:01" (3/3) ... [2019-09-07 19:11:01,197 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label54.c [2019-09-07 19:11:01,208 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:11:01,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:11:01,236 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:11:01,288 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:11:01,289 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:11:01,290 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:11:01,290 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:11:01,290 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:11:01,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:11:01,291 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:11:01,291 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:11:01,291 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:11:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 19:11:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 19:11:01,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:01,345 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] [2019-09-07 19:11:01,347 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1843653234, now seen corresponding path program 1 times [2019-09-07 19:11:01,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:01,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:01,695 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 19:11:01,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:01,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:11:01,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:11:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:11:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:11:01,722 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 3 states. [2019-09-07 19:11:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:07,121 INFO L93 Difference]: Finished difference Result 2443 states and 4697 transitions. [2019-09-07 19:11:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:11:07,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 19:11:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:07,161 INFO L225 Difference]: With dead ends: 2443 [2019-09-07 19:11:07,161 INFO L226 Difference]: Without dead ends: 1542 [2019-09-07 19:11:07,176 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 19:11:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-07 19:11:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-09-07 19:11:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-09-07 19:11:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2750 transitions. [2019-09-07 19:11:07,342 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2750 transitions. Word has length 39 [2019-09-07 19:11:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:07,343 INFO L475 AbstractCegarLoop]: Abstraction has 1542 states and 2750 transitions. [2019-09-07 19:11:07,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:11:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2750 transitions. [2019-09-07 19:11:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 19:11:07,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:07,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:07,352 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1185060153, now seen corresponding path program 1 times [2019-09-07 19:11:07,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:07,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:07,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:07,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:07,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:11:07,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:11:07,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:11:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:11:07,597 INFO L87 Difference]: Start difference. First operand 1542 states and 2750 transitions. Second operand 5 states. [2019-09-07 19:11:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:14,434 INFO L93 Difference]: Finished difference Result 4690 states and 8403 transitions. [2019-09-07 19:11:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:14,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-07 19:11:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:14,458 INFO L225 Difference]: With dead ends: 4690 [2019-09-07 19:11:14,458 INFO L226 Difference]: Without dead ends: 3154 [2019-09-07 19:11:14,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:11:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-09-07 19:11:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3122. [2019-09-07 19:11:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-09-07 19:11:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5336 transitions. [2019-09-07 19:11:14,592 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5336 transitions. Word has length 112 [2019-09-07 19:11:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:14,594 INFO L475 AbstractCegarLoop]: Abstraction has 3122 states and 5336 transitions. [2019-09-07 19:11:14,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:11:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5336 transitions. [2019-09-07 19:11:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 19:11:14,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:14,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:14,607 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -304531670, now seen corresponding path program 1 times [2019-09-07 19:11:14,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:14,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:14,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:14,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:14,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:14,836 INFO L87 Difference]: Start difference. First operand 3122 states and 5336 transitions. Second operand 6 states. [2019-09-07 19:11:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:21,867 INFO L93 Difference]: Finished difference Result 9491 states and 16483 transitions. [2019-09-07 19:11:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:21,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-07 19:11:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:21,914 INFO L225 Difference]: With dead ends: 9491 [2019-09-07 19:11:21,917 INFO L226 Difference]: Without dead ends: 6375 [2019-09-07 19:11:21,926 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 19:11:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-09-07 19:11:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6333. [2019-09-07 19:11:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-09-07 19:11:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 10771 transitions. [2019-09-07 19:11:22,144 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 10771 transitions. Word has length 117 [2019-09-07 19:11:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:22,146 INFO L475 AbstractCegarLoop]: Abstraction has 6333 states and 10771 transitions. [2019-09-07 19:11:22,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 10771 transitions. [2019-09-07 19:11:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 19:11:22,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:22,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:22,153 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 336331706, now seen corresponding path program 1 times [2019-09-07 19:11:22,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:22,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:22,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:22,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:22,351 INFO L87 Difference]: Start difference. First operand 6333 states and 10771 transitions. Second operand 6 states. [2019-09-07 19:11:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:28,282 INFO L93 Difference]: Finished difference Result 15980 states and 27530 transitions. [2019-09-07 19:11:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:28,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-09-07 19:11:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:28,330 INFO L225 Difference]: With dead ends: 15980 [2019-09-07 19:11:28,330 INFO L226 Difference]: Without dead ends: 9653 [2019-09-07 19:11:28,348 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 19:11:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-09-07 19:11:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9576. [2019-09-07 19:11:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2019-09-07 19:11:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 15608 transitions. [2019-09-07 19:11:28,667 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 15608 transitions. Word has length 125 [2019-09-07 19:11:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:28,668 INFO L475 AbstractCegarLoop]: Abstraction has 9576 states and 15608 transitions. [2019-09-07 19:11:28,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 15608 transitions. [2019-09-07 19:11:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 19:11:28,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:28,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:28,671 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1782179747, now seen corresponding path program 1 times [2019-09-07 19:11:28,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:28,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:28,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:28,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:28,874 INFO L87 Difference]: Start difference. First operand 9576 states and 15608 transitions. Second operand 6 states. [2019-09-07 19:11:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:41,802 INFO L93 Difference]: Finished difference Result 37842 states and 68764 transitions. [2019-09-07 19:11:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:11:41,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-07 19:11:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:42,019 INFO L225 Difference]: With dead ends: 37842 [2019-09-07 19:11:42,019 INFO L226 Difference]: Without dead ends: 28272 [2019-09-07 19:11:42,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:11:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28272 states. [2019-09-07 19:11:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28272 to 28091. [2019-09-07 19:11:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28091 states. [2019-09-07 19:11:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28091 states to 28091 states and 45131 transitions. [2019-09-07 19:11:44,082 INFO L78 Accepts]: Start accepts. Automaton has 28091 states and 45131 transitions. Word has length 142 [2019-09-07 19:11:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:44,083 INFO L475 AbstractCegarLoop]: Abstraction has 28091 states and 45131 transitions. [2019-09-07 19:11:44,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 28091 states and 45131 transitions. [2019-09-07 19:11:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 19:11:44,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:44,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:44,087 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash -137510042, now seen corresponding path program 1 times [2019-09-07 19:11:44,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:44,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:44,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:44,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:44,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:11:44,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:11:44,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:11:44,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:44,360 INFO L87 Difference]: Start difference. First operand 28091 states and 45131 transitions. Second operand 6 states. [2019-09-07 19:11:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:51,103 INFO L93 Difference]: Finished difference Result 69315 states and 116446 transitions. [2019-09-07 19:11:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:11:51,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-07 19:11:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:51,277 INFO L225 Difference]: With dead ends: 69315 [2019-09-07 19:11:51,277 INFO L226 Difference]: Without dead ends: 41230 [2019-09-07 19:11:51,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:11:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41230 states. [2019-09-07 19:11:52,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41230 to 41135. [2019-09-07 19:11:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41135 states. [2019-09-07 19:11:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41135 states to 41135 states and 62353 transitions. [2019-09-07 19:11:52,612 INFO L78 Accepts]: Start accepts. Automaton has 41135 states and 62353 transitions. Word has length 163 [2019-09-07 19:11:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:52,613 INFO L475 AbstractCegarLoop]: Abstraction has 41135 states and 62353 transitions. [2019-09-07 19:11:52,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 41135 states and 62353 transitions. [2019-09-07 19:11:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 19:11:52,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:52,618 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:52,618 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1611524629, now seen corresponding path program 1 times [2019-09-07 19:11:52,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:52,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:52,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:52,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 64 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:11:52,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:11:52,748 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 19:11:52,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:52,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:11:52,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:11:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 19:11:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:11:53,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-09-07 19:11:53,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:11:53,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:11:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:11:53,025 INFO L87 Difference]: Start difference. First operand 41135 states and 62353 transitions. Second operand 7 states. [2019-09-07 19:12:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:02,189 INFO L93 Difference]: Finished difference Result 115306 states and 187006 transitions. [2019-09-07 19:12:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:12:02,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2019-09-07 19:12:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:02,609 INFO L225 Difference]: With dead ends: 115306 [2019-09-07 19:12:02,610 INFO L226 Difference]: Without dead ends: 74177 [2019-09-07 19:12:02,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74177 states. [2019-09-07 19:12:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74177 to 69195. [2019-09-07 19:12:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69195 states. [2019-09-07 19:12:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69195 states to 69195 states and 104334 transitions. [2019-09-07 19:12:05,059 INFO L78 Accepts]: Start accepts. Automaton has 69195 states and 104334 transitions. Word has length 196 [2019-09-07 19:12:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:05,060 INFO L475 AbstractCegarLoop]: Abstraction has 69195 states and 104334 transitions. [2019-09-07 19:12:05,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:12:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69195 states and 104334 transitions. [2019-09-07 19:12:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 19:12:05,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:12:05,065 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:12:05,065 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:12:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:12:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash 369396127, now seen corresponding path program 1 times [2019-09-07 19:12:05,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:12:05,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:12:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:12:05,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:12:05,248 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 19:12:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:05,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:12:05,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:12:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:12:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:12:05,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:12:05,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:12:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:12:05,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:05,962 INFO L87 Difference]: Start difference. First operand 69195 states and 104334 transitions. Second operand 9 states. [2019-09-07 19:12:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:21,150 INFO L93 Difference]: Finished difference Result 174981 states and 315295 transitions. [2019-09-07 19:12:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:12:21,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 238 [2019-09-07 19:12:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:21,686 INFO L225 Difference]: With dead ends: 174981 [2019-09-07 19:12:21,686 INFO L226 Difference]: Without dead ends: 97434 [2019-09-07 19:12:21,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:12:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97434 states. [2019-09-07 19:12:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97434 to 93392. [2019-09-07 19:12:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93392 states. [2019-09-07 19:12:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93392 states to 93392 states and 144405 transitions. [2019-09-07 19:12:25,674 INFO L78 Accepts]: Start accepts. Automaton has 93392 states and 144405 transitions. Word has length 238 [2019-09-07 19:12:25,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:25,674 INFO L475 AbstractCegarLoop]: Abstraction has 93392 states and 144405 transitions. [2019-09-07 19:12:25,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:12:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 93392 states and 144405 transitions. [2019-09-07 19:12:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-07 19:12:25,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:12:25,691 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:12:25,691 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:12:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:12:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash 334189942, now seen corresponding path program 1 times [2019-09-07 19:12:25,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:12:25,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:12:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:12:26,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:12:26,143 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 19:12:26,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:26,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:12:26,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:12:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:12:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:12:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:12:26,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:12:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:12:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:26,470 INFO L87 Difference]: Start difference. First operand 93392 states and 144405 transitions. Second operand 9 states. [2019-09-07 19:12:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:43,640 INFO L93 Difference]: Finished difference Result 228160 states and 424367 transitions. [2019-09-07 19:12:43,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:12:43,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2019-09-07 19:12:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:44,511 INFO L225 Difference]: With dead ends: 228160 [2019-09-07 19:12:44,511 INFO L226 Difference]: Without dead ends: 134778 [2019-09-07 19:12:45,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:12:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134778 states. [2019-09-07 19:12:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134778 to 133833. [2019-09-07 19:12:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133833 states. [2019-09-07 19:12:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133833 states to 133833 states and 236979 transitions. [2019-09-07 19:12:52,943 INFO L78 Accepts]: Start accepts. Automaton has 133833 states and 236979 transitions. Word has length 299 [2019-09-07 19:12:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:52,944 INFO L475 AbstractCegarLoop]: Abstraction has 133833 states and 236979 transitions. [2019-09-07 19:12:52,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:12:52,944 INFO L276 IsEmpty]: Start isEmpty. Operand 133833 states and 236979 transitions. [2019-09-07 19:12:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-07 19:12:52,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:12:52,960 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:12:52,961 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:12:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:12:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -772950938, now seen corresponding path program 1 times [2019-09-07 19:12:52,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:12:52,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:12:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:52,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:12:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 101 proven. 143 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 19:12:53,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:12:53,214 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 19:12:53,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:12:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:12:53,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:12:53,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:12:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 281 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:12:53,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:12:53,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:12:53,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:12:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:12:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:12:53,445 INFO L87 Difference]: Start difference. First operand 133833 states and 236979 transitions. Second operand 9 states. [2019-09-07 19:13:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:13:04,814 INFO L93 Difference]: Finished difference Result 291710 states and 499196 transitions. [2019-09-07 19:13:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:13:04,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 333 [2019-09-07 19:13:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:13:09,808 INFO L225 Difference]: With dead ends: 291710 [2019-09-07 19:13:09,808 INFO L226 Difference]: Without dead ends: 157907 [2019-09-07 19:13:10,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:13:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157907 states. [2019-09-07 19:13:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157907 to 153076. [2019-09-07 19:13:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153076 states. [2019-09-07 19:13:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153076 states to 153076 states and 207378 transitions. [2019-09-07 19:13:12,748 INFO L78 Accepts]: Start accepts. Automaton has 153076 states and 207378 transitions. Word has length 333 [2019-09-07 19:13:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:13:12,749 INFO L475 AbstractCegarLoop]: Abstraction has 153076 states and 207378 transitions. [2019-09-07 19:13:12,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:13:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 153076 states and 207378 transitions. [2019-09-07 19:13:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-07 19:13:12,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:13:12,762 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:12,762 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:13:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:13:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -789179042, now seen corresponding path program 1 times [2019-09-07 19:13:12,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:13:12,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:13:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:12,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 188 proven. 78 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 19:13:12,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:13:12,994 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 19:13:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:13,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:13:13,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:13:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 307 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-07 19:13:13,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:13:13,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:13:13,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:13:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:13:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:13:13,204 INFO L87 Difference]: Start difference. First operand 153076 states and 207378 transitions. Second operand 9 states. [2019-09-07 19:13:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:13:34,731 INFO L93 Difference]: Finished difference Result 332768 states and 536742 transitions. [2019-09-07 19:13:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 19:13:34,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 355 [2019-09-07 19:13:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:13:35,744 INFO L225 Difference]: With dead ends: 332768 [2019-09-07 19:13:35,744 INFO L226 Difference]: Without dead ends: 177349 [2019-09-07 19:13:36,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 19:13:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177349 states. [2019-09-07 19:13:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177349 to 174298. [2019-09-07 19:13:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174298 states. [2019-09-07 19:13:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174298 states to 174298 states and 243564 transitions. [2019-09-07 19:13:47,130 INFO L78 Accepts]: Start accepts. Automaton has 174298 states and 243564 transitions. Word has length 355 [2019-09-07 19:13:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:13:47,131 INFO L475 AbstractCegarLoop]: Abstraction has 174298 states and 243564 transitions. [2019-09-07 19:13:47,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:13:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 174298 states and 243564 transitions. [2019-09-07 19:13:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-07 19:13:47,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:13:47,139 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:47,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:13:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:13:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1783460143, now seen corresponding path program 1 times [2019-09-07 19:13:47,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:13:47,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:13:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:13:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-09-07 19:13:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:13:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:13:47,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:13:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:13:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:13:47,335 INFO L87 Difference]: Start difference. First operand 174298 states and 243564 transitions. Second operand 4 states. [2019-09-07 19:13:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:13:56,007 INFO L93 Difference]: Finished difference Result 336517 states and 469338 transitions. [2019-09-07 19:13:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:13:56,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 364 [2019-09-07 19:13:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:13:56,545 INFO L225 Difference]: With dead ends: 336517 [2019-09-07 19:13:56,545 INFO L226 Difference]: Without dead ends: 162992 [2019-09-07 19:13:56,821 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 19:13:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162992 states. [2019-09-07 19:13:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162992 to 162140. [2019-09-07 19:13:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162140 states. [2019-09-07 19:13:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162140 states to 162140 states and 198783 transitions. [2019-09-07 19:13:59,749 INFO L78 Accepts]: Start accepts. Automaton has 162140 states and 198783 transitions. Word has length 364 [2019-09-07 19:13:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:13:59,750 INFO L475 AbstractCegarLoop]: Abstraction has 162140 states and 198783 transitions. [2019-09-07 19:13:59,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:13:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 162140 states and 198783 transitions. [2019-09-07 19:13:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-07 19:13:59,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:13:59,772 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:13:59,772 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:13:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:13:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -461277954, now seen corresponding path program 1 times [2019-09-07 19:13:59,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:13:59,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:13:59,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:13:59,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:13:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 306 proven. 31 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 19:14:00,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:14:00,067 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 19:14:03,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:03,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:14:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:14:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-07 19:14:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:14:04,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:14:04,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:14:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:14:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:14:04,064 INFO L87 Difference]: Start difference. First operand 162140 states and 198783 transitions. Second operand 4 states. [2019-09-07 19:14:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:14:11,382 INFO L93 Difference]: Finished difference Result 332987 states and 413320 transitions. [2019-09-07 19:14:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 19:14:11,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-07 19:14:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:14:11,941 INFO L225 Difference]: With dead ends: 332987 [2019-09-07 19:14:11,941 INFO L226 Difference]: Without dead ends: 171620 [2019-09-07 19:14:12,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:14:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171620 states. [2019-09-07 19:14:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171620 to 167612. [2019-09-07 19:14:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167612 states. [2019-09-07 19:14:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167612 states to 167612 states and 200172 transitions. [2019-09-07 19:14:14,981 INFO L78 Accepts]: Start accepts. Automaton has 167612 states and 200172 transitions. Word has length 499 [2019-09-07 19:14:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:14:14,982 INFO L475 AbstractCegarLoop]: Abstraction has 167612 states and 200172 transitions. [2019-09-07 19:14:14,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:14:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 167612 states and 200172 transitions. [2019-09-07 19:14:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-09-07 19:14:15,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:14:15,013 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:14:15,013 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:14:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:14:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 852168262, now seen corresponding path program 1 times [2019-09-07 19:14:15,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:14:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:14:15,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:15,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:15,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:14:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 547 proven. 6 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-07 19:14:16,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:14:16,157 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 19:14:16,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:14:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:14:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:14:16,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:14:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 462 proven. 2 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 19:14:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:14:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 19:14:16,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:14:16,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:14:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:14:16,469 INFO L87 Difference]: Start difference. First operand 167612 states and 200172 transitions. Second operand 6 states. [2019-09-07 19:14:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:14:28,904 INFO L93 Difference]: Finished difference Result 384298 states and 464652 transitions. [2019-09-07 19:14:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:14:28,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 559 [2019-09-07 19:14:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:14:28,909 INFO L225 Difference]: With dead ends: 384298 [2019-09-07 19:14:28,909 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 19:14:29,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:14:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 19:14:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 19:14:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 19:14:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 19:14:29,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 559 [2019-09-07 19:14:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:14:29,273 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 19:14:29,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:14:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 19:14:29,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 19:14:29,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 19:14:32,492 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-07 19:14:36,526 WARN L188 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-09-07 19:16:16,748 WARN L188 SmtUtils]: Spent 1.67 m on a formula simplification. DAG size of input: 5079 DAG size of output: 4674 [2019-09-07 19:17:57,502 WARN L188 SmtUtils]: Spent 1.68 m on a formula simplification. DAG size of input: 5079 DAG size of output: 4674 [2019-09-07 19:18:02,718 WARN L188 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:07,841 WARN L188 SmtUtils]: Spent 5.01 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:12,720 WARN L188 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:17,939 WARN L188 SmtUtils]: Spent 5.17 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:23,198 WARN L188 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:28,310 WARN L188 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:18:33,285 WARN L188 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 718 DAG size of output: 69 [2019-09-07 19:22:14,858 WARN L188 SmtUtils]: Spent 3.69 m on a formula simplification. DAG size of input: 4435 DAG size of output: 77