java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:22:26,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:22:26,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:22:26,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:22:26,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:22:26,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:22:26,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:22:26,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:22:26,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:22:26,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:22:26,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:22:26,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:22:26,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:22:26,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:22:26,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:22:26,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:22:26,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:22:26,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:22:26,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:22:26,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:22:26,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:22:26,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:22:26,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:22:26,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:22:26,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:22:26,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:22:26,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:22:26,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:22:26,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:22:26,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:22:26,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:22:26,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:22:26,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:22:26,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:22:26,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:22:26,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:22:26,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:22:26,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:22:26,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:22:26,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:22:26,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:22:26,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:22:26,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:22:26,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:22:26,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:22:26,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:22:26,246 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:22:26,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:22:26,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:22:26,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:22:26,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:22:26,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:22:26,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:22:26,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:22:26,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:22:26,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:22:26,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:22:26,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:22:26,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:22:26,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:22:26,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:22:26,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:22:26,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:22:26,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:22:26,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:22:26,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:22:26,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:22:26,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:22:26,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:22:26,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:22:26,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:22:26,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:22:26,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:22:26,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:22:26,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:22:26,300 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:22:26,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label03.c [2019-09-07 21:22:26,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f3806a/bb54893ddfbb42eea61842efdb86ac0f/FLAGf8ca4d155 [2019-09-07 21:22:27,140 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:22:27,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label03.c [2019-09-07 21:22:27,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f3806a/bb54893ddfbb42eea61842efdb86ac0f/FLAGf8ca4d155 [2019-09-07 21:22:27,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f3806a/bb54893ddfbb42eea61842efdb86ac0f [2019-09-07 21:22:27,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:22:27,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:22:27,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:22:27,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:22:27,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:22:27,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:22:27" (1/1) ... [2019-09-07 21:22:27,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa16274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:27, skipping insertion in model container [2019-09-07 21:22:27,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:22:27" (1/1) ... [2019-09-07 21:22:27,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:22:27,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:22:28,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:22:28,490 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:22:28,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:22:28,944 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:22:28,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28 WrapperNode [2019-09-07 21:22:28,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:22:28,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:22:28,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:22:28,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:22:28,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:28,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... [2019-09-07 21:22:29,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:22:29,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:22:29,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:22:29,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:22:29,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:22:29,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:22:29,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:22:29,425 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:22:29,425 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:22:29,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:22:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:22:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:22:29,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:22:33,284 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:22:33,285 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:22:33,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:22:33 BoogieIcfgContainer [2019-09-07 21:22:33,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:22:33,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:22:33,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:22:33,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:22:33,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:22:27" (1/3) ... [2019-09-07 21:22:33,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226791b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:22:33, skipping insertion in model container [2019-09-07 21:22:33,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:22:28" (2/3) ... [2019-09-07 21:22:33,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226791b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:22:33, skipping insertion in model container [2019-09-07 21:22:33,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:22:33" (3/3) ... [2019-09-07 21:22:33,298 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label03.c [2019-09-07 21:22:33,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:22:33,326 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:22:33,348 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:22:33,407 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:22:33,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:22:33,408 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:22:33,408 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:22:33,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:22:33,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:22:33,408 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:22:33,408 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:22:33,409 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:22:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:22:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 21:22:33,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:33,465 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] [2019-09-07 21:22:33,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1421926551, now seen corresponding path program 1 times [2019-09-07 21:22:33,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:33,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:33,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:33,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:22:33,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:22:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:22:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:22:33,923 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:22:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:40,154 INFO L93 Difference]: Finished difference Result 2160 states and 4005 transitions. [2019-09-07 21:22:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:22:40,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-07 21:22:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:40,197 INFO L225 Difference]: With dead ends: 2160 [2019-09-07 21:22:40,197 INFO L226 Difference]: Without dead ends: 1476 [2019-09-07 21:22:40,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:22:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-07 21:22:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 990. [2019-09-07 21:22:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-07 21:22:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1715 transitions. [2019-09-07 21:22:40,343 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1715 transitions. Word has length 55 [2019-09-07 21:22:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:40,344 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1715 transitions. [2019-09-07 21:22:40,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:22:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1715 transitions. [2019-09-07 21:22:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 21:22:40,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:40,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:22:40,351 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -775740193, now seen corresponding path program 1 times [2019-09-07 21:22:40,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:40,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:40,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:40,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:22:40,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:22:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:22:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:22:40,570 INFO L87 Difference]: Start difference. First operand 990 states and 1715 transitions. Second operand 5 states. [2019-09-07 21:22:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:45,369 INFO L93 Difference]: Finished difference Result 2903 states and 5092 transitions. [2019-09-07 21:22:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:22:45,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-07 21:22:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:45,386 INFO L225 Difference]: With dead ends: 2903 [2019-09-07 21:22:45,387 INFO L226 Difference]: Without dead ends: 1919 [2019-09-07 21:22:45,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:22:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-09-07 21:22:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1895. [2019-09-07 21:22:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 21:22:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2965 transitions. [2019-09-07 21:22:45,461 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2965 transitions. Word has length 126 [2019-09-07 21:22:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:45,462 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 2965 transitions. [2019-09-07 21:22:45,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:22:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2965 transitions. [2019-09-07 21:22:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 21:22:45,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:45,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:22:45,466 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1672472177, now seen corresponding path program 1 times [2019-09-07 21:22:45,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:45,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:45,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:45,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:45,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:45,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:22:45,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:22:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:22:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:22:45,620 INFO L87 Difference]: Start difference. First operand 1895 states and 2965 transitions. Second operand 3 states. [2019-09-07 21:22:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:48,761 INFO L93 Difference]: Finished difference Result 5557 states and 8868 transitions. [2019-09-07 21:22:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:22:48,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-07 21:22:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:48,789 INFO L225 Difference]: With dead ends: 5557 [2019-09-07 21:22:48,789 INFO L226 Difference]: Without dead ends: 3668 [2019-09-07 21:22:48,795 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 21:22:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2019-09-07 21:22:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3665. [2019-09-07 21:22:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2019-09-07 21:22:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5192 transitions. [2019-09-07 21:22:48,921 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5192 transitions. Word has length 129 [2019-09-07 21:22:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:48,931 INFO L475 AbstractCegarLoop]: Abstraction has 3665 states and 5192 transitions. [2019-09-07 21:22:48,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:22:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5192 transitions. [2019-09-07 21:22:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 21:22:48,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:48,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:22:48,938 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash -861781381, now seen corresponding path program 1 times [2019-09-07 21:22:48,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:48,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:49,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:22:49,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 21:22:49,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:22:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:22:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:22:49,124 INFO L87 Difference]: Start difference. First operand 3665 states and 5192 transitions. Second operand 7 states. [2019-09-07 21:22:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:22:59,433 INFO L93 Difference]: Finished difference Result 12617 states and 19512 transitions. [2019-09-07 21:22:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 21:22:59,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-07 21:22:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:22:59,495 INFO L225 Difference]: With dead ends: 12617 [2019-09-07 21:22:59,496 INFO L226 Difference]: Without dead ends: 8958 [2019-09-07 21:22:59,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:22:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-07 21:22:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8859. [2019-09-07 21:22:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8859 states. [2019-09-07 21:22:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8859 states to 8859 states and 12662 transitions. [2019-09-07 21:22:59,829 INFO L78 Accepts]: Start accepts. Automaton has 8859 states and 12662 transitions. Word has length 156 [2019-09-07 21:22:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:22:59,831 INFO L475 AbstractCegarLoop]: Abstraction has 8859 states and 12662 transitions. [2019-09-07 21:22:59,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:22:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8859 states and 12662 transitions. [2019-09-07 21:22:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 21:22:59,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:22:59,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:22:59,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:22:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:22:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash -322424838, now seen corresponding path program 1 times [2019-09-07 21:22:59,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:22:59,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:22:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:59,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:22:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:22:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:22:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:22:59,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:23:00,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:23:00,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:23:00,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:23:00,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:23:00,002 INFO L87 Difference]: Start difference. First operand 8859 states and 12662 transitions. Second operand 5 states. [2019-09-07 21:23:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:05,343 INFO L93 Difference]: Finished difference Result 24545 states and 37835 transitions. [2019-09-07 21:23:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 21:23:05,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-07 21:23:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:05,441 INFO L225 Difference]: With dead ends: 24545 [2019-09-07 21:23:05,442 INFO L226 Difference]: Without dead ends: 15692 [2019-09-07 21:23:05,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:23:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15692 states. [2019-09-07 21:23:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15692 to 15482. [2019-09-07 21:23:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15482 states. [2019-09-07 21:23:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15482 states to 15482 states and 21448 transitions. [2019-09-07 21:23:05,901 INFO L78 Accepts]: Start accepts. Automaton has 15482 states and 21448 transitions. Word has length 168 [2019-09-07 21:23:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:05,902 INFO L475 AbstractCegarLoop]: Abstraction has 15482 states and 21448 transitions. [2019-09-07 21:23:05,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:23:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15482 states and 21448 transitions. [2019-09-07 21:23:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 21:23:05,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:05,909 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, 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] [2019-09-07 21:23:05,909 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -971691658, now seen corresponding path program 1 times [2019-09-07 21:23:05,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:05,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 7 proven. 95 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-07 21:23:06,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:06,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:23:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:06,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:23:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:23:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 21:23:06,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:23:06,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 21:23:06,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:23:06,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:23:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:23:06,640 INFO L87 Difference]: Start difference. First operand 15482 states and 21448 transitions. Second operand 12 states. [2019-09-07 21:23:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:30,351 INFO L93 Difference]: Finished difference Result 60216 states and 97618 transitions. [2019-09-07 21:23:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 21:23:30,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 235 [2019-09-07 21:23:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:30,686 INFO L225 Difference]: With dead ends: 60216 [2019-09-07 21:23:30,686 INFO L226 Difference]: Without dead ends: 44740 [2019-09-07 21:23:30,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1212, Invalid=5928, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 21:23:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44740 states. [2019-09-07 21:23:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44740 to 43591. [2019-09-07 21:23:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43591 states. [2019-09-07 21:23:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43591 states to 43591 states and 63495 transitions. [2019-09-07 21:23:33,110 INFO L78 Accepts]: Start accepts. Automaton has 43591 states and 63495 transitions. Word has length 235 [2019-09-07 21:23:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:33,111 INFO L475 AbstractCegarLoop]: Abstraction has 43591 states and 63495 transitions. [2019-09-07 21:23:33,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:23:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 43591 states and 63495 transitions. [2019-09-07 21:23:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-07 21:23:33,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:33,128 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, 2, 2, 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] [2019-09-07 21:23:33,129 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:33,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1032078862, now seen corresponding path program 1 times [2019-09-07 21:23:33,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:33,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 97 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:23:33,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:33,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:33,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:23:33,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:23:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:23:34,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:23:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:23:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:23:34,413 INFO L87 Difference]: Start difference. First operand 43591 states and 63495 transitions. Second operand 9 states. [2019-09-07 21:23:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:40,812 INFO L93 Difference]: Finished difference Result 93032 states and 137471 transitions. [2019-09-07 21:23:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 21:23:40,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2019-09-07 21:23:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:40,940 INFO L225 Difference]: With dead ends: 93032 [2019-09-07 21:23:40,941 INFO L226 Difference]: Without dead ends: 39935 [2019-09-07 21:23:41,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:23:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39935 states. [2019-09-07 21:23:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39935 to 34205. [2019-09-07 21:23:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34205 states. [2019-09-07 21:23:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 42930 transitions. [2019-09-07 21:23:41,750 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 42930 transitions. Word has length 242 [2019-09-07 21:23:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:41,750 INFO L475 AbstractCegarLoop]: Abstraction has 34205 states and 42930 transitions. [2019-09-07 21:23:41,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:23:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 42930 transitions. [2019-09-07 21:23:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 21:23:41,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:41,763 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:41,763 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1152803790, now seen corresponding path program 1 times [2019-09-07 21:23:41,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:41,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 21:23:42,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:42,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:42,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:23:42,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 21:23:42,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:23:42,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 21:23:42,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:23:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:23:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:23:42,343 INFO L87 Difference]: Start difference. First operand 34205 states and 42930 transitions. Second operand 7 states. [2019-09-07 21:23:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:49,559 INFO L93 Difference]: Finished difference Result 81457 states and 107155 transitions. [2019-09-07 21:23:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:23:49,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-07 21:23:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:49,720 INFO L225 Difference]: With dead ends: 81457 [2019-09-07 21:23:49,721 INFO L226 Difference]: Without dead ends: 45470 [2019-09-07 21:23:49,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:23:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45470 states. [2019-09-07 21:23:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45470 to 44307. [2019-09-07 21:23:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44307 states. [2019-09-07 21:23:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44307 states to 44307 states and 53828 transitions. [2019-09-07 21:23:50,747 INFO L78 Accepts]: Start accepts. Automaton has 44307 states and 53828 transitions. Word has length 352 [2019-09-07 21:23:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:50,747 INFO L475 AbstractCegarLoop]: Abstraction has 44307 states and 53828 transitions. [2019-09-07 21:23:50,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:23:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44307 states and 53828 transitions. [2019-09-07 21:23:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-07 21:23:50,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:50,764 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:50,764 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash 754137252, now seen corresponding path program 1 times [2019-09-07 21:23:50,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:50,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 278 proven. 143 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:23:51,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:51,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:23:51,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:51,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:23:51,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:23:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:23:51,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:23:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:23:51,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:23:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:23:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:23:51,657 INFO L87 Difference]: Start difference. First operand 44307 states and 53828 transitions. Second operand 9 states. [2019-09-07 21:23:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:23:58,420 INFO L93 Difference]: Finished difference Result 89904 states and 108977 transitions. [2019-09-07 21:23:58,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 21:23:58,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 375 [2019-09-07 21:23:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:23:58,553 INFO L225 Difference]: With dead ends: 89904 [2019-09-07 21:23:58,553 INFO L226 Difference]: Without dead ends: 45603 [2019-09-07 21:23:58,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:23:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45603 states. [2019-09-07 21:23:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45603 to 43001. [2019-09-07 21:23:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43001 states. [2019-09-07 21:23:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43001 states to 43001 states and 52056 transitions. [2019-09-07 21:23:59,384 INFO L78 Accepts]: Start accepts. Automaton has 43001 states and 52056 transitions. Word has length 375 [2019-09-07 21:23:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:23:59,384 INFO L475 AbstractCegarLoop]: Abstraction has 43001 states and 52056 transitions. [2019-09-07 21:23:59,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:23:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 43001 states and 52056 transitions. [2019-09-07 21:23:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-07 21:23:59,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:23:59,398 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:23:59,398 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:23:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:23:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 457477337, now seen corresponding path program 1 times [2019-09-07 21:23:59,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:23:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:23:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:59,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:23:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:23:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:23:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 152 proven. 146 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 21:23:59,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:23:59,937 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 21:23:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:00,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:24:00,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:24:00,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:00,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 21:24:00,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:24:00,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2019-09-07 21:24:00,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:24:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:24:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:24:00,382 INFO L87 Difference]: Start difference. First operand 43001 states and 52056 transitions. Second operand 13 states. [2019-09-07 21:24:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:24:10,581 INFO L93 Difference]: Finished difference Result 114423 states and 146195 transitions. [2019-09-07 21:24:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 21:24:10,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 383 [2019-09-07 21:24:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:24:10,814 INFO L225 Difference]: With dead ends: 114423 [2019-09-07 21:24:10,815 INFO L226 Difference]: Without dead ends: 70958 [2019-09-07 21:24:10,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-07 21:24:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70958 states. [2019-09-07 21:24:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70958 to 64170. [2019-09-07 21:24:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64170 states. [2019-09-07 21:24:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64170 states to 64170 states and 77901 transitions. [2019-09-07 21:24:12,660 INFO L78 Accepts]: Start accepts. Automaton has 64170 states and 77901 transitions. Word has length 383 [2019-09-07 21:24:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:24:12,661 INFO L475 AbstractCegarLoop]: Abstraction has 64170 states and 77901 transitions. [2019-09-07 21:24:12,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:24:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 64170 states and 77901 transitions. [2019-09-07 21:24:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-09-07 21:24:12,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:24:12,690 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, 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, 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] [2019-09-07 21:24:12,690 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:24:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:24:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1376152041, now seen corresponding path program 1 times [2019-09-07 21:24:12,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:24:12,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:24:12,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:24:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:24:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 296 proven. 157 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 21:24:13,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:24:13,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:24:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:24:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:24:13,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:24:13,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:24:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:24:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:24:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 517 proven. 2 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 21:24:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:24:14,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:24:14,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:24:14,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:24:14,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:24:14,267 INFO L87 Difference]: Start difference. First operand 64170 states and 77901 transitions. Second operand 16 states. [2019-09-07 21:27:45,276 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-07 21:27:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:27:58,625 INFO L93 Difference]: Finished difference Result 214934 states and 266751 transitions. [2019-09-07 21:27:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-07 21:27:58,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 431 [2019-09-07 21:27:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:27:59,016 INFO L225 Difference]: With dead ends: 214934 [2019-09-07 21:27:59,017 INFO L226 Difference]: Without dead ends: 148538 [2019-09-07 21:27:59,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13463 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4189, Invalid=27317, Unknown=0, NotChecked=0, Total=31506 [2019-09-07 21:27:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148538 states. [2019-09-07 21:28:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148538 to 130941. [2019-09-07 21:28:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130941 states. [2019-09-07 21:28:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130941 states to 130941 states and 160001 transitions. [2019-09-07 21:28:02,010 INFO L78 Accepts]: Start accepts. Automaton has 130941 states and 160001 transitions. Word has length 431 [2019-09-07 21:28:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:28:02,010 INFO L475 AbstractCegarLoop]: Abstraction has 130941 states and 160001 transitions. [2019-09-07 21:28:02,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:28:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 130941 states and 160001 transitions. [2019-09-07 21:28:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-09-07 21:28:02,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:28:02,050 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:28:02,050 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:28:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:28:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1037559554, now seen corresponding path program 1 times [2019-09-07 21:28:02,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:28:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:28:02,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:02,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:28:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:28:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 21:28:02,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:28:02,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:28:02,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:28:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:28:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:28:02,421 INFO L87 Difference]: Start difference. First operand 130941 states and 160001 transitions. Second operand 3 states. [2019-09-07 21:28:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:28:11,390 INFO L93 Difference]: Finished difference Result 282341 states and 348442 transitions. [2019-09-07 21:28:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:28:11,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 529 [2019-09-07 21:28:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:28:11,738 INFO L225 Difference]: With dead ends: 282341 [2019-09-07 21:28:11,738 INFO L226 Difference]: Without dead ends: 151406 [2019-09-07 21:28:11,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:28:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151406 states. [2019-09-07 21:28:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151406 to 147048. [2019-09-07 21:28:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147048 states. [2019-09-07 21:28:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147048 states to 147048 states and 179847 transitions. [2019-09-07 21:28:14,350 INFO L78 Accepts]: Start accepts. Automaton has 147048 states and 179847 transitions. Word has length 529 [2019-09-07 21:28:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:28:14,351 INFO L475 AbstractCegarLoop]: Abstraction has 147048 states and 179847 transitions. [2019-09-07 21:28:14,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:28:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 147048 states and 179847 transitions. [2019-09-07 21:28:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-09-07 21:28:14,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:28:14,382 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:28:14,382 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:28:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:28:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1873420517, now seen corresponding path program 1 times [2019-09-07 21:28:14,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:28:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:28:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:28:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:28:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 440 proven. 71 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-07 21:28:14,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:28:14,939 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 21:28:14,965 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 21:28:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:28:15,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:28:15,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:28:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 409 proven. 2 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 21:28:15,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:28:15,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 21:28:15,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:28:15,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:28:15,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:28:15,326 INFO L87 Difference]: Start difference. First operand 147048 states and 179847 transitions. Second operand 10 states. [2019-09-07 21:28:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:28:49,884 INFO L93 Difference]: Finished difference Result 377526 states and 475693 transitions. [2019-09-07 21:28:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 21:28:49,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 531 [2019-09-07 21:28:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:28:51,010 INFO L225 Difference]: With dead ends: 377526 [2019-09-07 21:28:51,010 INFO L226 Difference]: Without dead ends: 226384 [2019-09-07 21:28:51,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=570, Invalid=2621, Unknown=1, NotChecked=0, Total=3192 [2019-09-07 21:28:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226384 states. [2019-09-07 21:28:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226384 to 219194. [2019-09-07 21:28:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219194 states. [2019-09-07 21:28:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219194 states to 219194 states and 269147 transitions. [2019-09-07 21:28:58,320 INFO L78 Accepts]: Start accepts. Automaton has 219194 states and 269147 transitions. Word has length 531 [2019-09-07 21:28:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:28:58,321 INFO L475 AbstractCegarLoop]: Abstraction has 219194 states and 269147 transitions. [2019-09-07 21:28:58,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:28:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 219194 states and 269147 transitions. [2019-09-07 21:28:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-07 21:28:58,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:28:58,354 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, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:28:58,354 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:28:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:28:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash -106282368, now seen corresponding path program 1 times [2019-09-07 21:28:58,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:28:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:28:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:58,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:28:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:28:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:28:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 646 proven. 157 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-09-07 21:28:58,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:28:58,824 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 21:28:58,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:28:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:28:58,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:28:59,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:28:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:28:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:28:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:29:47,493 WARN L188 SmtUtils]: Spent 48.30 s on a formula simplification. DAG size of input: 432 DAG size of output: 76 [2019-09-07 21:29:47,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:29:53,565 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 21:29:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 775 proven. 80 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:29:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:29:54,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:29:54,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:29:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:29:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=200, Unknown=1, NotChecked=0, Total=240 [2019-09-07 21:29:54,513 INFO L87 Difference]: Start difference. First operand 219194 states and 269147 transitions. Second operand 16 states. [2019-09-07 21:30:30,319 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-09-07 21:30:34,408 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-07 21:30:42,581 WARN L188 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 21:31:39,050 WARN L188 SmtUtils]: Spent 48.20 s on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-09-07 21:32:53,996 WARN L188 SmtUtils]: Spent 48.19 s on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-09-07 21:33:17,616 WARN L188 SmtUtils]: Spent 12.08 s on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-09-07 21:33:25,797 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-07 21:33:30,002 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 21:33:59,874 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 92 DAG size of output: 50 [2019-09-07 21:34:19,062 WARN L188 SmtUtils]: Spent 12.08 s on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2019-09-07 21:34:32,974 WARN L188 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 93 DAG size of output: 51 [2019-09-07 21:35:05,372 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 21:35:15,702 WARN L188 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-07 21:36:11,219 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 92 DAG size of output: 54