java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:46:18,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:46:18,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:46:19,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:46:19,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:46:19,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:46:19,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:46:19,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:46:19,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:46:19,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:46:19,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:46:19,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:46:19,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:46:19,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:46:19,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:46:19,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:46:19,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:46:19,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:46:19,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:46:19,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:46:19,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:46:19,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:46:19,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:46:19,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:46:19,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:46:19,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:46:19,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:46:19,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:46:19,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:46:19,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:46:19,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:46:19,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:46:19,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:46:19,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:46:19,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:46:19,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:46:19,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:46:19,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:46:19,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:46:19,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:46:19,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:46:19,039 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:46:19,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:46:19,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:46:19,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:46:19,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:46:19,055 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:46:19,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:46:19,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:46:19,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:46:19,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:46:19,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:46:19,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:46:19,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:46:19,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:46:19,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:46:19,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:46:19,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:46:19,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:46:19,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:46:19,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:46:19,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:46:19,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:46:19,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:46:19,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:46:19,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:46:19,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:46:19,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:46:19,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:46:19,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:46:19,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:46:19,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:46:19,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:46:19,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:46:19,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:46:19,106 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:46:19,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label38.c [2019-09-07 19:46:19,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53be840/c74edcacb9e1454baf0cea14bcd01896/FLAGc4496c23c [2019-09-07 19:46:20,017 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:46:20,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label38.c [2019-09-07 19:46:20,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53be840/c74edcacb9e1454baf0cea14bcd01896/FLAGc4496c23c [2019-09-07 19:46:20,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53be840/c74edcacb9e1454baf0cea14bcd01896 [2019-09-07 19:46:20,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:46:20,522 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:46:20,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:46:20,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:46:20,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:46:20,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:46:20" (1/1) ... [2019-09-07 19:46:20,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d455d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:20, skipping insertion in model container [2019-09-07 19:46:20,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:46:20" (1/1) ... [2019-09-07 19:46:20,538 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:46:20,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:46:22,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:46:22,311 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:46:23,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:46:23,060 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:46:23,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23 WrapperNode [2019-09-07 19:46:23,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:46:23,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:46:23,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:46:23,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:46:23,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (1/1) ... [2019-09-07 19:46:23,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:46:23,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:46:23,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:46:23,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:46:23,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (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:46:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:46:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:46:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:46:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:46:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:46:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:46:23,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:46:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:46:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:46:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:46:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:46:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:46:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:46:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:46:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:46:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:46:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:46:29,503 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:46:29,503 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:46:29,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:46:29 BoogieIcfgContainer [2019-09-07 19:46:29,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:46:29,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:46:29,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:46:29,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:46:29,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:46:20" (1/3) ... [2019-09-07 19:46:29,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482340e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:46:29, skipping insertion in model container [2019-09-07 19:46:29,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:46:23" (2/3) ... [2019-09-07 19:46:29,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482340e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:46:29, skipping insertion in model container [2019-09-07 19:46:29,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:46:29" (3/3) ... [2019-09-07 19:46:29,521 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label38.c [2019-09-07 19:46:29,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:46:29,544 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:46:29,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:46:29,613 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:46:29,613 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:46:29,614 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:46:29,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:46:29,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:46:29,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:46:29,614 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:46:29,614 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:46:29,615 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:46:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:46:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 19:46:29,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:29,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:29,673 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1954796256, now seen corresponding path program 1 times [2019-09-07 19:46:29,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:29,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:29,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:30,095 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:46:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:30,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:46:30,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:46:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:46:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:46:30,120 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:46:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:36,304 INFO L93 Difference]: Finished difference Result 3084 states and 5696 transitions. [2019-09-07 19:46:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:46:36,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-07 19:46:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:36,354 INFO L225 Difference]: With dead ends: 3084 [2019-09-07 19:46:36,355 INFO L226 Difference]: Without dead ends: 1903 [2019-09-07 19:46:36,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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:46:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-09-07 19:46:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2019-09-07 19:46:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-07 19:46:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3341 transitions. [2019-09-07 19:46:36,532 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3341 transitions. Word has length 65 [2019-09-07 19:46:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:36,534 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 3341 transitions. [2019-09-07 19:46:36,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:46:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3341 transitions. [2019-09-07 19:46:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 19:46:36,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:36,550 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:46:36,550 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 766329083, now seen corresponding path program 1 times [2019-09-07 19:46:36,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:36,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:36,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:46:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:46:36,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:46:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:46:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:46:36,826 INFO L87 Difference]: Start difference. First operand 1897 states and 3341 transitions. Second operand 6 states. [2019-09-07 19:46:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:44,049 INFO L93 Difference]: Finished difference Result 5506 states and 9832 transitions. [2019-09-07 19:46:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:46:44,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-07 19:46:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:44,083 INFO L225 Difference]: With dead ends: 5506 [2019-09-07 19:46:44,083 INFO L226 Difference]: Without dead ends: 3615 [2019-09-07 19:46:44,090 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:46:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2019-09-07 19:46:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3586. [2019-09-07 19:46:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2019-09-07 19:46:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5675 transitions. [2019-09-07 19:46:44,197 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5675 transitions. Word has length 141 [2019-09-07 19:46:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:44,198 INFO L475 AbstractCegarLoop]: Abstraction has 3586 states and 5675 transitions. [2019-09-07 19:46:44,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:46:44,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5675 transitions. [2019-09-07 19:46:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 19:46:44,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:44,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,202 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash 849858349, now seen corresponding path program 1 times [2019-09-07 19:46:44,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:46:44,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:44,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:46:44,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:46:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:46:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:46:44,419 INFO L87 Difference]: Start difference. First operand 3586 states and 5675 transitions. Second operand 6 states. [2019-09-07 19:46:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:51,233 INFO L93 Difference]: Finished difference Result 10675 states and 17456 transitions. [2019-09-07 19:46:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:46:51,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-07 19:46:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:51,274 INFO L225 Difference]: With dead ends: 10675 [2019-09-07 19:46:51,277 INFO L226 Difference]: Without dead ends: 7095 [2019-09-07 19:46:51,290 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:46:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2019-09-07 19:46:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 7042. [2019-09-07 19:46:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-09-07 19:46:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 10530 transitions. [2019-09-07 19:46:51,513 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 10530 transitions. Word has length 160 [2019-09-07 19:46:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:51,513 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 10530 transitions. [2019-09-07 19:46:51,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:46:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 10530 transitions. [2019-09-07 19:46:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 19:46:51,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:51,517 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,518 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1680594875, now seen corresponding path program 1 times [2019-09-07 19:46:51,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:51,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:51,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:51,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:46:51,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:46:51,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:46:51,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:46:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:46:51,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:46:51,710 INFO L87 Difference]: Start difference. First operand 7042 states and 10530 transitions. Second operand 6 states. [2019-09-07 19:46:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:59,008 INFO L93 Difference]: Finished difference Result 17986 states and 27932 transitions. [2019-09-07 19:46:59,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:46:59,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-07 19:46:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:59,088 INFO L225 Difference]: With dead ends: 17986 [2019-09-07 19:46:59,088 INFO L226 Difference]: Without dead ends: 10950 [2019-09-07 19:46:59,109 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:46:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2019-09-07 19:46:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 10780. [2019-09-07 19:46:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-09-07 19:46:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15827 transitions. [2019-09-07 19:46:59,350 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15827 transitions. Word has length 172 [2019-09-07 19:46:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:59,352 INFO L475 AbstractCegarLoop]: Abstraction has 10780 states and 15827 transitions. [2019-09-07 19:46:59,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:46:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15827 transitions. [2019-09-07 19:46:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-07 19:46:59,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:59,361 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:46:59,362 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1292363234, now seen corresponding path program 1 times [2019-09-07 19:46:59,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:59,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 116 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:46:59,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:59,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:46:59,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:59,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:46:59,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-07 19:46:59,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:46:59,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 19:46:59,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:46:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:46:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:46:59,841 INFO L87 Difference]: Start difference. First operand 10780 states and 15827 transitions. Second operand 6 states. [2019-09-07 19:47:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:08,657 INFO L93 Difference]: Finished difference Result 32492 states and 53256 transitions. [2019-09-07 19:47:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:47:08,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-09-07 19:47:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:08,771 INFO L225 Difference]: With dead ends: 32492 [2019-09-07 19:47:08,772 INFO L226 Difference]: Without dead ends: 21718 [2019-09-07 19:47:08,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:47:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2019-09-07 19:47:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 21245. [2019-09-07 19:47:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21245 states. [2019-09-07 19:47:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21245 states to 21245 states and 30806 transitions. [2019-09-07 19:47:09,538 INFO L78 Accepts]: Start accepts. Automaton has 21245 states and 30806 transitions. Word has length 226 [2019-09-07 19:47:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:09,539 INFO L475 AbstractCegarLoop]: Abstraction has 21245 states and 30806 transitions. [2019-09-07 19:47:09,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:47:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21245 states and 30806 transitions. [2019-09-07 19:47:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 19:47:09,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:09,545 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,546 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1999720170, now seen corresponding path program 1 times [2019-09-07 19:47:09,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:09,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:09,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:47:09,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:47:09,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:47:09,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:47:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:47:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:47:09,738 INFO L87 Difference]: Start difference. First operand 21245 states and 30806 transitions. Second operand 4 states. [2019-09-07 19:47:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:18,806 INFO L93 Difference]: Finished difference Result 80515 states and 127307 transitions. [2019-09-07 19:47:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:47:18,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-09-07 19:47:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:19,030 INFO L225 Difference]: With dead ends: 80515 [2019-09-07 19:47:19,030 INFO L226 Difference]: Without dead ends: 59276 [2019-09-07 19:47:19,076 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:47:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59276 states. [2019-09-07 19:47:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59276 to 59129. [2019-09-07 19:47:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59129 states. [2019-09-07 19:47:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59129 states to 59129 states and 94371 transitions. [2019-09-07 19:47:22,379 INFO L78 Accepts]: Start accepts. Automaton has 59129 states and 94371 transitions. Word has length 235 [2019-09-07 19:47:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:22,381 INFO L475 AbstractCegarLoop]: Abstraction has 59129 states and 94371 transitions. [2019-09-07 19:47:22,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:47:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 59129 states and 94371 transitions. [2019-09-07 19:47:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-07 19:47:22,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:22,409 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:47:22,410 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1336665589, now seen corresponding path program 1 times [2019-09-07 19:47:22,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:22,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 174 proven. 179 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 19:47:22,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:22,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:47:22,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:47:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:22,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:47:22,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 19:47:22,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:47:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:47:22,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:47:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:47:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:47:22,930 INFO L87 Difference]: Start difference. First operand 59129 states and 94371 transitions. Second operand 8 states. [2019-09-07 19:47:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:43,776 INFO L93 Difference]: Finished difference Result 166745 states and 283566 transitions. [2019-09-07 19:47:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 19:47:43,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 357 [2019-09-07 19:47:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:44,305 INFO L225 Difference]: With dead ends: 166745 [2019-09-07 19:47:44,305 INFO L226 Difference]: Without dead ends: 107622 [2019-09-07 19:47:44,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 19:47:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107622 states. [2019-09-07 19:47:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107622 to 102516. [2019-09-07 19:47:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102516 states. [2019-09-07 19:47:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102516 states to 102516 states and 165825 transitions. [2019-09-07 19:47:49,291 INFO L78 Accepts]: Start accepts. Automaton has 102516 states and 165825 transitions. Word has length 357 [2019-09-07 19:47:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:49,292 INFO L475 AbstractCegarLoop]: Abstraction has 102516 states and 165825 transitions. [2019-09-07 19:47:49,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:47:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 102516 states and 165825 transitions. [2019-09-07 19:47:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-09-07 19:47:49,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:49,327 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:47:49,328 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1078028054, now seen corresponding path program 1 times [2019-09-07 19:47:49,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:49,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:49,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 174 proven. 4 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-07 19:47:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:49,599 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) [2019-09-07 19:47:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:47:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:49,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:47:49,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-09-07 19:47:49,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:47:49,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 19:47:49,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:47:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:47:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:47:49,833 INFO L87 Difference]: Start difference. First operand 102516 states and 165825 transitions. Second operand 4 states. [2019-09-07 19:48:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:03,622 INFO L93 Difference]: Finished difference Result 289520 states and 487891 transitions. [2019-09-07 19:48:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:48:03,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-09-07 19:48:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:04,295 INFO L225 Difference]: With dead ends: 289520 [2019-09-07 19:48:04,295 INFO L226 Difference]: Without dead ends: 187010 [2019-09-07 19:48:04,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 408 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:48:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187010 states. [2019-09-07 19:48:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187010 to 178964. [2019-09-07 19:48:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178964 states. [2019-09-07 19:48:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178964 states to 178964 states and 283748 transitions. [2019-09-07 19:48:07,451 INFO L78 Accepts]: Start accepts. Automaton has 178964 states and 283748 transitions. Word has length 408 [2019-09-07 19:48:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:07,451 INFO L475 AbstractCegarLoop]: Abstraction has 178964 states and 283748 transitions. [2019-09-07 19:48:07,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:48:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 178964 states and 283748 transitions. [2019-09-07 19:48:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-07 19:48:07,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:07,493 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:07,493 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1363985108, now seen corresponding path program 1 times [2019-09-07 19:48:07,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:07,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:07,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-07 19:48:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:48:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:48:08,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:48:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:48:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:48:08,555 INFO L87 Difference]: Start difference. First operand 178964 states and 283748 transitions. Second operand 3 states. [2019-09-07 19:48:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:48:18,219 INFO L93 Difference]: Finished difference Result 357093 states and 566927 transitions. [2019-09-07 19:48:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:48:18,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 464 [2019-09-07 19:48:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:48:18,708 INFO L225 Difference]: With dead ends: 357093 [2019-09-07 19:48:18,708 INFO L226 Difference]: Without dead ends: 178938 [2019-09-07 19:48:18,922 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:48:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178938 states. [2019-09-07 19:48:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178938 to 154007. [2019-09-07 19:48:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154007 states. [2019-09-07 19:48:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154007 states to 154007 states and 214366 transitions. [2019-09-07 19:48:21,698 INFO L78 Accepts]: Start accepts. Automaton has 154007 states and 214366 transitions. Word has length 464 [2019-09-07 19:48:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:21,699 INFO L475 AbstractCegarLoop]: Abstraction has 154007 states and 214366 transitions. [2019-09-07 19:48:21,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:48:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 154007 states and 214366 transitions. [2019-09-07 19:48:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-07 19:48:21,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:21,743 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:48:21,743 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 330671998, now seen corresponding path program 1 times [2019-09-07 19:48:21,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 472 proven. 265 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 19:48:23,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:23,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:48:23,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:48:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:23,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:48:23,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 527 proven. 2 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-09-07 19:48:23,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:48:23,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-07 19:48:23,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:48:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:48:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:48:23,648 INFO L87 Difference]: Start difference. First operand 154007 states and 214366 transitions. Second operand 13 states. [2019-09-07 19:49:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:31,136 INFO L93 Difference]: Finished difference Result 475184 states and 734376 transitions. [2019-09-07 19:49:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-07 19:49:31,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 572 [2019-09-07 19:49:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:32,214 INFO L225 Difference]: With dead ends: 475184 [2019-09-07 19:49:32,214 INFO L226 Difference]: Without dead ends: 321986 [2019-09-07 19:49:32,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 645 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1335, Invalid=9377, Unknown=0, NotChecked=0, Total=10712 [2019-09-07 19:49:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321986 states. [2019-09-07 19:49:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321986 to 303084. [2019-09-07 19:49:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303084 states. [2019-09-07 19:49:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303084 states to 303084 states and 393771 transitions. [2019-09-07 19:49:44,407 INFO L78 Accepts]: Start accepts. Automaton has 303084 states and 393771 transitions. Word has length 572 [2019-09-07 19:49:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:44,407 INFO L475 AbstractCegarLoop]: Abstraction has 303084 states and 393771 transitions. [2019-09-07 19:49:44,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:49:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 303084 states and 393771 transitions. [2019-09-07 19:49:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-07 19:49:44,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:44,461 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:44,462 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -18247737, now seen corresponding path program 1 times [2019-09-07 19:49:44,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 299 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:49:49,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:49:49,368 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:49:49,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:49,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:49:49,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:49:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-07 19:49:49,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:49:49,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 20 [2019-09-07 19:49:49,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 19:49:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 19:49:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:49:49,734 INFO L87 Difference]: Start difference. First operand 303084 states and 393771 transitions. Second operand 20 states. [2019-09-07 19:51:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:12,464 INFO L93 Difference]: Finished difference Result 664217 states and 933135 transitions. [2019-09-07 19:51:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-09-07 19:51:12,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 580 [2019-09-07 19:51:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:14,447 INFO L225 Difference]: With dead ends: 664217 [2019-09-07 19:51:14,447 INFO L226 Difference]: Without dead ends: 353273 [2019-09-07 19:51:14,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20055 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=5335, Invalid=42407, Unknown=0, NotChecked=0, Total=47742 [2019-09-07 19:51:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353273 states. [2019-09-07 19:51:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353273 to 314886. [2019-09-07 19:51:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314886 states. [2019-09-07 19:51:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314886 states to 314886 states and 387261 transitions. [2019-09-07 19:51:22,815 INFO L78 Accepts]: Start accepts. Automaton has 314886 states and 387261 transitions. Word has length 580 [2019-09-07 19:51:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:22,816 INFO L475 AbstractCegarLoop]: Abstraction has 314886 states and 387261 transitions. [2019-09-07 19:51:22,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 19:51:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 314886 states and 387261 transitions. [2019-09-07 19:51:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2019-09-07 19:51:24,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:24,521 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,522 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash 901920260, now seen corresponding path program 1 times [2019-09-07 19:51:24,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:24,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:24,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:24,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:24,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 479 proven. 397 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-07 19:51:30,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:30,930 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:51:30,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:31,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:51:31,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:31,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:51:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 693 proven. 2 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-09-07 19:51:31,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:51:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 23 [2019-09-07 19:51:31,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 19:51:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 19:51:31,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:51:31,547 INFO L87 Difference]: Start difference. First operand 314886 states and 387261 transitions. Second operand 23 states. [2019-09-07 19:52:01,054 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-07 19:52:25,141 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-07 19:52:45,472 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-07 19:53:14,604 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-07 19:53:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:44,815 INFO L93 Difference]: Finished difference Result 714847 states and 891750 transitions. [2019-09-07 19:53:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2019-09-07 19:53:44,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 680 [2019-09-07 19:53:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:46,364 INFO L225 Difference]: With dead ends: 714847 [2019-09-07 19:53:46,364 INFO L226 Difference]: Without dead ends: 400779 [2019-09-07 19:53:47,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73624 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=13794, Invalid=147408, Unknown=0, NotChecked=0, Total=161202 [2019-09-07 19:53:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400779 states. [2019-09-07 19:53:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400779 to 386605. [2019-09-07 19:53:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386605 states. [2019-09-07 19:54:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386605 states to 386605 states and 468305 transitions. [2019-09-07 19:54:05,950 INFO L78 Accepts]: Start accepts. Automaton has 386605 states and 468305 transitions. Word has length 680 [2019-09-07 19:54:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:05,950 INFO L475 AbstractCegarLoop]: Abstraction has 386605 states and 468305 transitions. [2019-09-07 19:54:05,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 19:54:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 386605 states and 468305 transitions. [2019-09-07 19:54:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-09-07 19:54:05,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:05,992 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:54:05,993 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1984856810, now seen corresponding path program 1 times [2019-09-07 19:54:05,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:05,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 245 proven. 449 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:54:09,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:09,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:54:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:54:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:09,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:54:09,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:54:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 637 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-07 19:54:10,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:54:10,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:54:10,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:54:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:54:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:54:10,519 INFO L87 Difference]: Start difference. First operand 386605 states and 468305 transitions. Second operand 16 states. [2019-09-07 19:54:31,275 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 19:55:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:55:00,870 INFO L93 Difference]: Finished difference Result 794679 states and 958697 transitions. [2019-09-07 19:55:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-07 19:55:00,871 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 734 [2019-09-07 19:55:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:55:02,185 INFO L225 Difference]: With dead ends: 794679 [2019-09-07 19:55:02,186 INFO L226 Difference]: Without dead ends: 423991 [2019-09-07 19:55:03,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 818 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5218 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1857, Invalid=11483, Unknown=0, NotChecked=0, Total=13340 [2019-09-07 19:55:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423991 states. [2019-09-07 19:55:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423991 to 418476. [2019-09-07 19:55:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418476 states. [2019-09-07 19:55:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418476 states to 418476 states and 499511 transitions. [2019-09-07 19:55:17,558 INFO L78 Accepts]: Start accepts. Automaton has 418476 states and 499511 transitions. Word has length 734 [2019-09-07 19:55:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:17,559 INFO L475 AbstractCegarLoop]: Abstraction has 418476 states and 499511 transitions. [2019-09-07 19:55:17,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:55:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 418476 states and 499511 transitions. [2019-09-07 19:55:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1125 [2019-09-07 19:55:17,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:17,653 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,653 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 62042162, now seen corresponding path program 1 times [2019-09-07 19:55:17,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:17,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:17,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1803 backedges. 770 proven. 763 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-07 19:55:25,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:55:25,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:55:25,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:25,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:55:25,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:55:25,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1803 backedges. 1445 proven. 2 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-07 19:55:26,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:55:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 19:55:26,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 19:55:26,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 19:55:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:55:26,569 INFO L87 Difference]: Start difference. First operand 418476 states and 499511 transitions. Second operand 17 states. [2019-09-07 19:56:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:20,826 INFO L93 Difference]: Finished difference Result 929669 states and 1117225 transitions. [2019-09-07 19:56:20,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-07 19:56:20,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1124 [2019-09-07 19:56:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:22,290 INFO L225 Difference]: With dead ends: 929669 [2019-09-07 19:56:22,291 INFO L226 Difference]: Without dead ends: 510384 [2019-09-07 19:56:22,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1212 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1701, Invalid=10509, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:56:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510384 states. [2019-09-07 19:56:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510384 to 498911. [2019-09-07 19:56:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498911 states. [2019-09-07 19:56:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498911 states to 498911 states and 579195 transitions. [2019-09-07 19:56:43,802 INFO L78 Accepts]: Start accepts. Automaton has 498911 states and 579195 transitions. Word has length 1124 [2019-09-07 19:56:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:56:43,803 INFO L475 AbstractCegarLoop]: Abstraction has 498911 states and 579195 transitions. [2019-09-07 19:56:43,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 19:56:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 498911 states and 579195 transitions. [2019-09-07 19:56:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1129 [2019-09-07 19:56:43,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:56:43,895 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,895 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:56:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:56:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1538466040, now seen corresponding path program 1 times [2019-09-07 19:56:43,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:56:43,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:56:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1708 backedges. 1194 proven. 201 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 19:56:46,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:56:46,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:56:46,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:46,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 19:56:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:56:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:48,375 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 19:56:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:56:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:54,014 WARN L188 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2019-09-07 19:56:54,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:56:54,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:57:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1708 backedges. 618 proven. 908 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-07 19:57:00,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:57:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2019-09-07 19:57:00,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 19:57:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 19:57:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:57:00,565 INFO L87 Difference]: Start difference. First operand 498911 states and 579195 transitions. Second operand 24 states. [2019-09-07 19:57:09,803 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-09-07 19:57:10,562 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-09-07 19:57:25,917 WARN L188 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 19:57:44,086 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-09-07 19:57:58,607 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 19:58:00,651 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 42 DAG size of output: 31