/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:04,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:04,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:04,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:04,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:04,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:04,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:04,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:04,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:04,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:04,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:04,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:04,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:04,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:04,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:04,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:04,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:04,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:04,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:04,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:04,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:04,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:04,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:04,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:04,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:04,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:04,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:04,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:04,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:04,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:04,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:04,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:04,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:04,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:04,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:04,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:04,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:04,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:04,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:04,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:04,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:04,638 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-11-23 22:31:04,658 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:04,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:04,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:04,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:04,661 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:04,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:04,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:04,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:04,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:04,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:04,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:04,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:04,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:04,664 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:04,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:04,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:04,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:04,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:04,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:04,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:04,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:04,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:04,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:04,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:04,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:04,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:04,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:04,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:04,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:04,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:04,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:04,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:04,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:04,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:04,957 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:04,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:31:05,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0f78366/2a0bcc7c1c664a4b8c07b8e9733beb7d/FLAG489a99982 [2019-11-23 22:31:05,576 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:05,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:31:05,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0f78366/2a0bcc7c1c664a4b8c07b8e9733beb7d/FLAG489a99982 [2019-11-23 22:31:05,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0f78366/2a0bcc7c1c664a4b8c07b8e9733beb7d [2019-11-23 22:31:05,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:05,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:05,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:05,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:05,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:05,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:05" (1/1) ... [2019-11-23 22:31:05,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1942077c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:05, skipping insertion in model container [2019-11-23 22:31:05,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:05" (1/1) ... [2019-11-23 22:31:05,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:05,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:06,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:06,605 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:07,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:07,077 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:07,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07 WrapperNode [2019-11-23 22:31:07,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:07,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:07,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:07,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:07,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:07,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:07,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:07,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:07,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (1/1) ... [2019-11-23 22:31:07,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:07,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:07,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:07,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:07,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (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-11-23 22:31:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:07,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:09,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:09,260 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:09,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:09 BoogieIcfgContainer [2019-11-23 22:31:09,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:09,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:09,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:09,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:09,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:05" (1/3) ... [2019-11-23 22:31:09,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:09, skipping insertion in model container [2019-11-23 22:31:09,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:07" (2/3) ... [2019-11-23 22:31:09,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:09, skipping insertion in model container [2019-11-23 22:31:09,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:09" (3/3) ... [2019-11-23 22:31:09,271 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:31:09,283 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:09,292 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:31:09,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:31:09,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:09,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:09,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:09,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:09,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:09,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:09,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:09,339 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states. [2019-11-23 22:31:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-23 22:31:09,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:09,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:09,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1203570768, now seen corresponding path program 1 times [2019-11-23 22:31:09,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:09,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145457242] [2019-11-23 22:31:09,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:10,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145457242] [2019-11-23 22:31:10,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:10,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:10,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545203626] [2019-11-23 22:31:10,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:10,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:10,425 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 4 states. [2019-11-23 22:31:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:10,643 INFO L93 Difference]: Finished difference Result 1100 states and 1983 transitions. [2019-11-23 22:31:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:10,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-23 22:31:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:10,674 INFO L225 Difference]: With dead ends: 1100 [2019-11-23 22:31:10,674 INFO L226 Difference]: Without dead ends: 726 [2019-11-23 22:31:10,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-11-23 22:31:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 701. [2019-11-23 22:31:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-11-23 22:31:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1004 transitions. [2019-11-23 22:31:10,810 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1004 transitions. Word has length 139 [2019-11-23 22:31:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:10,811 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 1004 transitions. [2019-11-23 22:31:10,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1004 transitions. [2019-11-23 22:31:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 22:31:10,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:10,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:10,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:10,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1141139268, now seen corresponding path program 1 times [2019-11-23 22:31:10,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:10,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831172859] [2019-11-23 22:31:10,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:10,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831172859] [2019-11-23 22:31:10,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:10,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:10,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445934251] [2019-11-23 22:31:10,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:10,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:10,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:10,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:10,936 INFO L87 Difference]: Start difference. First operand 701 states and 1004 transitions. Second operand 3 states. [2019-11-23 22:31:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:11,017 INFO L93 Difference]: Finished difference Result 2065 states and 2950 transitions. [2019-11-23 22:31:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:11,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 22:31:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:11,027 INFO L225 Difference]: With dead ends: 2065 [2019-11-23 22:31:11,027 INFO L226 Difference]: Without dead ends: 1392 [2019-11-23 22:31:11,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-11-23 22:31:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 703. [2019-11-23 22:31:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-11-23 22:31:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1006 transitions. [2019-11-23 22:31:11,103 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1006 transitions. Word has length 140 [2019-11-23 22:31:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:11,105 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1006 transitions. [2019-11-23 22:31:11,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1006 transitions. [2019-11-23 22:31:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:11,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:11,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:11,112 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1084924930, now seen corresponding path program 1 times [2019-11-23 22:31:11,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:11,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481219806] [2019-11-23 22:31:11,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:11,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481219806] [2019-11-23 22:31:11,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:11,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:11,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783669497] [2019-11-23 22:31:11,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:11,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:11,287 INFO L87 Difference]: Start difference. First operand 703 states and 1006 transitions. Second operand 3 states. [2019-11-23 22:31:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:11,402 INFO L93 Difference]: Finished difference Result 1889 states and 2711 transitions. [2019-11-23 22:31:11,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:11,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-23 22:31:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:11,411 INFO L225 Difference]: With dead ends: 1889 [2019-11-23 22:31:11,411 INFO L226 Difference]: Without dead ends: 1364 [2019-11-23 22:31:11,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-11-23 22:31:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1339. [2019-11-23 22:31:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-23 22:31:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1907 transitions. [2019-11-23 22:31:11,478 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1907 transitions. Word has length 141 [2019-11-23 22:31:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:11,479 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 1907 transitions. [2019-11-23 22:31:11,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1907 transitions. [2019-11-23 22:31:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:11,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:11,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:11,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -980453119, now seen corresponding path program 1 times [2019-11-23 22:31:11,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488635938] [2019-11-23 22:31:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:11,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488635938] [2019-11-23 22:31:11,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:11,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:11,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525795] [2019-11-23 22:31:11,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:11,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:11,771 INFO L87 Difference]: Start difference. First operand 1339 states and 1907 transitions. Second operand 4 states. [2019-11-23 22:31:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:11,856 INFO L93 Difference]: Finished difference Result 2197 states and 3137 transitions. [2019-11-23 22:31:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:11,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-23 22:31:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:11,864 INFO L225 Difference]: With dead ends: 2197 [2019-11-23 22:31:11,864 INFO L226 Difference]: Without dead ends: 1026 [2019-11-23 22:31:11,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-11-23 22:31:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2019-11-23 22:31:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-11-23 22:31:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1453 transitions. [2019-11-23 22:31:11,923 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1453 transitions. Word has length 141 [2019-11-23 22:31:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:11,923 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1453 transitions. [2019-11-23 22:31:11,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1453 transitions. [2019-11-23 22:31:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:31:11,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:11,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:11,927 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1168757507, now seen corresponding path program 1 times [2019-11-23 22:31:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:11,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093574097] [2019-11-23 22:31:11,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:12,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093574097] [2019-11-23 22:31:12,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:12,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:12,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821332388] [2019-11-23 22:31:12,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:12,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:12,054 INFO L87 Difference]: Start difference. First operand 1026 states and 1453 transitions. Second operand 3 states. [2019-11-23 22:31:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:12,774 INFO L93 Difference]: Finished difference Result 2646 states and 3788 transitions. [2019-11-23 22:31:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:12,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:31:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:12,785 INFO L225 Difference]: With dead ends: 2646 [2019-11-23 22:31:12,786 INFO L226 Difference]: Without dead ends: 1873 [2019-11-23 22:31:12,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-23 22:31:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1848. [2019-11-23 22:31:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-23 22:31:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2630 transitions. [2019-11-23 22:31:12,870 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2630 transitions. Word has length 147 [2019-11-23 22:31:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:12,870 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2630 transitions. [2019-11-23 22:31:12,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2630 transitions. [2019-11-23 22:31:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:31:12,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:12,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:12,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 668575330, now seen corresponding path program 1 times [2019-11-23 22:31:12,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:12,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748313486] [2019-11-23 22:31:12,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:13,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748313486] [2019-11-23 22:31:13,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:13,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:13,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248576691] [2019-11-23 22:31:13,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:13,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:13,103 INFO L87 Difference]: Start difference. First operand 1848 states and 2630 transitions. Second operand 4 states. [2019-11-23 22:31:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:13,359 INFO L93 Difference]: Finished difference Result 3382 states and 4978 transitions. [2019-11-23 22:31:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:13,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 22:31:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:13,374 INFO L225 Difference]: With dead ends: 3382 [2019-11-23 22:31:13,375 INFO L226 Difference]: Without dead ends: 2810 [2019-11-23 22:31:13,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-23 22:31:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-11-23 22:31:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-11-23 22:31:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-11-23 22:31:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4040 transitions. [2019-11-23 22:31:13,587 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4040 transitions. Word has length 147 [2019-11-23 22:31:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:13,589 INFO L462 AbstractCegarLoop]: Abstraction has 2808 states and 4040 transitions. [2019-11-23 22:31:13,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4040 transitions. [2019-11-23 22:31:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:31:13,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:13,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:13,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2048583783, now seen corresponding path program 1 times [2019-11-23 22:31:13,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:13,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228672099] [2019-11-23 22:31:13,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:13,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228672099] [2019-11-23 22:31:13,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:13,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:13,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141720980] [2019-11-23 22:31:13,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:13,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:13,712 INFO L87 Difference]: Start difference. First operand 2808 states and 4040 transitions. Second operand 3 states. [2019-11-23 22:31:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:13,977 INFO L93 Difference]: Finished difference Result 5536 states and 8266 transitions. [2019-11-23 22:31:13,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:13,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:31:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:14,003 INFO L225 Difference]: With dead ends: 5536 [2019-11-23 22:31:14,003 INFO L226 Difference]: Without dead ends: 4451 [2019-11-23 22:31:14,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2019-11-23 22:31:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 4449. [2019-11-23 22:31:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4449 states. [2019-11-23 22:31:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6493 transitions. [2019-11-23 22:31:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6493 transitions. Word has length 147 [2019-11-23 22:31:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:14,290 INFO L462 AbstractCegarLoop]: Abstraction has 4449 states and 6493 transitions. [2019-11-23 22:31:14,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6493 transitions. [2019-11-23 22:31:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:31:14,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:14,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:14,301 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -101387384, now seen corresponding path program 1 times [2019-11-23 22:31:14,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:14,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766044760] [2019-11-23 22:31:14,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:14,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766044760] [2019-11-23 22:31:14,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:14,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:14,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954484707] [2019-11-23 22:31:14,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:14,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:14,551 INFO L87 Difference]: Start difference. First operand 4449 states and 6493 transitions. Second operand 4 states. [2019-11-23 22:31:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:14,962 INFO L93 Difference]: Finished difference Result 11588 states and 16901 transitions. [2019-11-23 22:31:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:14,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-23 22:31:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:14,994 INFO L225 Difference]: With dead ends: 11588 [2019-11-23 22:31:14,995 INFO L226 Difference]: Without dead ends: 7158 [2019-11-23 22:31:15,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2019-11-23 22:31:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 7136. [2019-11-23 22:31:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-11-23 22:31:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 10302 transitions. [2019-11-23 22:31:15,367 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 10302 transitions. Word has length 147 [2019-11-23 22:31:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:15,367 INFO L462 AbstractCegarLoop]: Abstraction has 7136 states and 10302 transitions. [2019-11-23 22:31:15,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 10302 transitions. [2019-11-23 22:31:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:31:15,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:15,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:15,378 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1272506948, now seen corresponding path program 1 times [2019-11-23 22:31:15,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:15,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39440921] [2019-11-23 22:31:15,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:15,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39440921] [2019-11-23 22:31:15,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:15,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:15,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619068926] [2019-11-23 22:31:15,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:15,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:15,466 INFO L87 Difference]: Start difference. First operand 7136 states and 10302 transitions. Second operand 3 states. [2019-11-23 22:31:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:16,070 INFO L93 Difference]: Finished difference Result 20323 states and 29354 transitions. [2019-11-23 22:31:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:31:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:16,131 INFO L225 Difference]: With dead ends: 20323 [2019-11-23 22:31:16,132 INFO L226 Difference]: Without dead ends: 13660 [2019-11-23 22:31:16,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2019-11-23 22:31:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 13640. [2019-11-23 22:31:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13640 states. [2019-11-23 22:31:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 19472 transitions. [2019-11-23 22:31:16,756 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 19472 transitions. Word has length 149 [2019-11-23 22:31:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:16,756 INFO L462 AbstractCegarLoop]: Abstraction has 13640 states and 19472 transitions. [2019-11-23 22:31:16,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 19472 transitions. [2019-11-23 22:31:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:31:16,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:16,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:16,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash -235144953, now seen corresponding path program 1 times [2019-11-23 22:31:16,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:16,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597895256] [2019-11-23 22:31:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:16,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597895256] [2019-11-23 22:31:16,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:16,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:16,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989471542] [2019-11-23 22:31:16,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:16,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:16,935 INFO L87 Difference]: Start difference. First operand 13640 states and 19472 transitions. Second operand 4 states. [2019-11-23 22:31:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:17,450 INFO L93 Difference]: Finished difference Result 21757 states and 31033 transitions. [2019-11-23 22:31:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:17,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-23 22:31:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:17,473 INFO L225 Difference]: With dead ends: 21757 [2019-11-23 22:31:17,474 INFO L226 Difference]: Without dead ends: 11111 [2019-11-23 22:31:17,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2019-11-23 22:31:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 11111. [2019-11-23 22:31:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11111 states. [2019-11-23 22:31:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11111 states to 11111 states and 15800 transitions. [2019-11-23 22:31:18,583 INFO L78 Accepts]: Start accepts. Automaton has 11111 states and 15800 transitions. Word has length 149 [2019-11-23 22:31:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:18,584 INFO L462 AbstractCegarLoop]: Abstraction has 11111 states and 15800 transitions. [2019-11-23 22:31:18,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 11111 states and 15800 transitions. [2019-11-23 22:31:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:31:18,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:18,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:18,604 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1597470439, now seen corresponding path program 1 times [2019-11-23 22:31:18,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:18,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009443980] [2019-11-23 22:31:18,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:18,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009443980] [2019-11-23 22:31:18,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:18,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:18,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905196156] [2019-11-23 22:31:18,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:18,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:18,899 INFO L87 Difference]: Start difference. First operand 11111 states and 15800 transitions. Second operand 8 states. [2019-11-23 22:31:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:19,731 INFO L93 Difference]: Finished difference Result 22720 states and 32954 transitions. [2019-11-23 22:31:19,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:19,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2019-11-23 22:31:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:19,763 INFO L225 Difference]: With dead ends: 22720 [2019-11-23 22:31:19,763 INFO L226 Difference]: Without dead ends: 18034 [2019-11-23 22:31:19,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18034 states. [2019-11-23 22:31:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 18032. [2019-11-23 22:31:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18032 states. [2019-11-23 22:31:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18032 states to 18032 states and 25326 transitions. [2019-11-23 22:31:20,551 INFO L78 Accepts]: Start accepts. Automaton has 18032 states and 25326 transitions. Word has length 155 [2019-11-23 22:31:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:20,552 INFO L462 AbstractCegarLoop]: Abstraction has 18032 states and 25326 transitions. [2019-11-23 22:31:20,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:31:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18032 states and 25326 transitions. [2019-11-23 22:31:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:31:20,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:20,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:20,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1547996009, now seen corresponding path program 1 times [2019-11-23 22:31:20,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:20,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786863209] [2019-11-23 22:31:20,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:20,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786863209] [2019-11-23 22:31:20,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:20,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:20,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915042895] [2019-11-23 22:31:20,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:20,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:20,771 INFO L87 Difference]: Start difference. First operand 18032 states and 25326 transitions. Second operand 4 states. [2019-11-23 22:31:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:22,001 INFO L93 Difference]: Finished difference Result 52790 states and 73908 transitions. [2019-11-23 22:31:22,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:22,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-23 22:31:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:22,073 INFO L225 Difference]: With dead ends: 52790 [2019-11-23 22:31:22,073 INFO L226 Difference]: Without dead ends: 34797 [2019-11-23 22:31:22,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34797 states. [2019-11-23 22:31:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34797 to 34753. [2019-11-23 22:31:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34753 states. [2019-11-23 22:31:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34753 states to 34753 states and 48111 transitions. [2019-11-23 22:31:23,885 INFO L78 Accepts]: Start accepts. Automaton has 34753 states and 48111 transitions. Word has length 155 [2019-11-23 22:31:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:23,886 INFO L462 AbstractCegarLoop]: Abstraction has 34753 states and 48111 transitions. [2019-11-23 22:31:23,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34753 states and 48111 transitions. [2019-11-23 22:31:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:31:23,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:23,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:23,922 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1019371775, now seen corresponding path program 1 times [2019-11-23 22:31:23,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:23,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187883590] [2019-11-23 22:31:23,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:23,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187883590] [2019-11-23 22:31:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:23,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918160781] [2019-11-23 22:31:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:23,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:23,971 INFO L87 Difference]: Start difference. First operand 34753 states and 48111 transitions. Second operand 3 states. [2019-11-23 22:31:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:26,021 INFO L93 Difference]: Finished difference Result 104067 states and 144084 transitions. [2019-11-23 22:31:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:26,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:31:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:26,115 INFO L225 Difference]: With dead ends: 104067 [2019-11-23 22:31:26,115 INFO L226 Difference]: Without dead ends: 69419 [2019-11-23 22:31:26,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69419 states. [2019-11-23 22:31:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69419 to 34759. [2019-11-23 22:31:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-11-23 22:31:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 48117 transitions. [2019-11-23 22:31:28,703 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 48117 transitions. Word has length 156 [2019-11-23 22:31:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:28,703 INFO L462 AbstractCegarLoop]: Abstraction has 34759 states and 48117 transitions. [2019-11-23 22:31:28,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 48117 transitions. [2019-11-23 22:31:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:31:28,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:28,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:28,723 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 234138742, now seen corresponding path program 1 times [2019-11-23 22:31:28,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:28,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802877346] [2019-11-23 22:31:28,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:28,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802877346] [2019-11-23 22:31:28,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:28,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:28,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789157736] [2019-11-23 22:31:28,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:28,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:28,854 INFO L87 Difference]: Start difference. First operand 34759 states and 48117 transitions. Second operand 4 states. [2019-11-23 22:31:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:30,141 INFO L93 Difference]: Finished difference Result 69480 states and 96182 transitions. [2019-11-23 22:31:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:30,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 22:31:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:30,172 INFO L225 Difference]: With dead ends: 69480 [2019-11-23 22:31:30,173 INFO L226 Difference]: Without dead ends: 34753 [2019-11-23 22:31:30,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34753 states. [2019-11-23 22:31:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34753 to 34753. [2019-11-23 22:31:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34753 states. [2019-11-23 22:31:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34753 states to 34753 states and 48105 transitions. [2019-11-23 22:31:31,621 INFO L78 Accepts]: Start accepts. Automaton has 34753 states and 48105 transitions. Word has length 157 [2019-11-23 22:31:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:31,621 INFO L462 AbstractCegarLoop]: Abstraction has 34753 states and 48105 transitions. [2019-11-23 22:31:31,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 34753 states and 48105 transitions. [2019-11-23 22:31:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:31:31,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:31,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:31,637 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash -609898143, now seen corresponding path program 1 times [2019-11-23 22:31:31,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:31,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94163081] [2019-11-23 22:31:31,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:31,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94163081] [2019-11-23 22:31:31,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:31,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984067012] [2019-11-23 22:31:31,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:31,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:31,719 INFO L87 Difference]: Start difference. First operand 34753 states and 48105 transitions. Second operand 3 states. [2019-11-23 22:31:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:34,477 INFO L93 Difference]: Finished difference Result 85369 states and 117906 transitions. [2019-11-23 22:31:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:34,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:31:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:34,525 INFO L225 Difference]: With dead ends: 85369 [2019-11-23 22:31:34,525 INFO L226 Difference]: Without dead ends: 51553 [2019-11-23 22:31:34,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:31:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51553 states. [2019-11-23 22:31:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51553 to 51509. [2019-11-23 22:31:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51509 states. [2019-11-23 22:31:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51509 states to 51509 states and 69966 transitions. [2019-11-23 22:31:36,452 INFO L78 Accepts]: Start accepts. Automaton has 51509 states and 69966 transitions. Word has length 157 [2019-11-23 22:31:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:36,452 INFO L462 AbstractCegarLoop]: Abstraction has 51509 states and 69966 transitions. [2019-11-23 22:31:36,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 51509 states and 69966 transitions. [2019-11-23 22:31:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:31:36,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:36,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:36,483 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -941679734, now seen corresponding path program 1 times [2019-11-23 22:31:36,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:36,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002704830] [2019-11-23 22:31:36,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:36,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002704830] [2019-11-23 22:31:36,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:36,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:31:36,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834715979] [2019-11-23 22:31:36,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:31:36,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:31:36,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:31:36,755 INFO L87 Difference]: Start difference. First operand 51509 states and 69966 transitions. Second operand 10 states. [2019-11-23 22:31:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:39,227 INFO L93 Difference]: Finished difference Result 96086 states and 130603 transitions. [2019-11-23 22:31:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:31:39,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2019-11-23 22:31:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:39,280 INFO L225 Difference]: With dead ends: 96086 [2019-11-23 22:31:39,280 INFO L226 Difference]: Without dead ends: 51509 [2019-11-23 22:31:39,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:31:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51509 states. [2019-11-23 22:31:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51509 to 51509. [2019-11-23 22:31:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51509 states. [2019-11-23 22:31:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51509 states to 51509 states and 69054 transitions. [2019-11-23 22:31:42,613 INFO L78 Accepts]: Start accepts. Automaton has 51509 states and 69054 transitions. Word has length 163 [2019-11-23 22:31:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:42,613 INFO L462 AbstractCegarLoop]: Abstraction has 51509 states and 69054 transitions. [2019-11-23 22:31:42,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:31:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51509 states and 69054 transitions. [2019-11-23 22:31:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:31:42,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:42,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:42,640 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1530284517, now seen corresponding path program 1 times [2019-11-23 22:31:42,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:42,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642164314] [2019-11-23 22:31:42,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:43,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642164314] [2019-11-23 22:31:43,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:43,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:31:43,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329543348] [2019-11-23 22:31:43,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:31:43,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:31:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:31:43,128 INFO L87 Difference]: Start difference. First operand 51509 states and 69054 transitions. Second operand 15 states. [2019-11-23 22:31:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:51,032 INFO L93 Difference]: Finished difference Result 128224 states and 177160 transitions. [2019-11-23 22:31:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 22:31:51,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2019-11-23 22:31:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:51,153 INFO L225 Difference]: With dead ends: 128224 [2019-11-23 22:31:51,153 INFO L226 Difference]: Without dead ends: 120634 [2019-11-23 22:31:51,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:31:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120634 states. [2019-11-23 22:31:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120634 to 57198. [2019-11-23 22:31:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57198 states. [2019-11-23 22:31:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57198 states to 57198 states and 75662 transitions. [2019-11-23 22:31:56,408 INFO L78 Accepts]: Start accepts. Automaton has 57198 states and 75662 transitions. Word has length 163 [2019-11-23 22:31:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:56,409 INFO L462 AbstractCegarLoop]: Abstraction has 57198 states and 75662 transitions. [2019-11-23 22:31:56,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:31:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57198 states and 75662 transitions. [2019-11-23 22:31:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:31:56,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:56,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:31:56,434 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 888809919, now seen corresponding path program 1 times [2019-11-23 22:31:56,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:56,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169230950] [2019-11-23 22:31:56,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:31:56,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169230950] [2019-11-23 22:31:56,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:56,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:56,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77925963] [2019-11-23 22:31:56,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:56,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:56,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:56,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:56,615 INFO L87 Difference]: Start difference. First operand 57198 states and 75662 transitions. Second operand 8 states. [2019-11-23 22:31:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:59,536 INFO L93 Difference]: Finished difference Result 80342 states and 110647 transitions. [2019-11-23 22:31:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:59,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 163 [2019-11-23 22:31:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:59,583 INFO L225 Difference]: With dead ends: 80342 [2019-11-23 22:31:59,583 INFO L226 Difference]: Without dead ends: 57200 [2019-11-23 22:31:59,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57200 states. [2019-11-23 22:32:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57200 to 57198. [2019-11-23 22:32:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57198 states. [2019-11-23 22:32:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57198 states to 57198 states and 75326 transitions. [2019-11-23 22:32:02,704 INFO L78 Accepts]: Start accepts. Automaton has 57198 states and 75326 transitions. Word has length 163 [2019-11-23 22:32:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:02,705 INFO L462 AbstractCegarLoop]: Abstraction has 57198 states and 75326 transitions. [2019-11-23 22:32:02,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:32:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 57198 states and 75326 transitions. [2019-11-23 22:32:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:32:02,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:02,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:32:02,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 292054911, now seen corresponding path program 1 times [2019-11-23 22:32:02,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:02,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26360190] [2019-11-23 22:32:02,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:03,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26360190] [2019-11-23 22:32:03,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:03,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:32:03,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884407778] [2019-11-23 22:32:03,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:32:03,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:32:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:32:03,197 INFO L87 Difference]: Start difference. First operand 57198 states and 75326 transitions. Second operand 15 states. [2019-11-23 22:32:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:13,450 INFO L93 Difference]: Finished difference Result 138076 states and 184006 transitions. [2019-11-23 22:32:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 22:32:13,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 163 [2019-11-23 22:32:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:13,564 INFO L225 Difference]: With dead ends: 138076 [2019-11-23 22:32:13,564 INFO L226 Difference]: Without dead ends: 136062 [2019-11-23 22:32:13,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 22:32:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136062 states. [2019-11-23 22:32:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136062 to 61798. [2019-11-23 22:32:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61798 states. [2019-11-23 22:32:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61798 states to 61798 states and 80742 transitions. [2019-11-23 22:32:17,842 INFO L78 Accepts]: Start accepts. Automaton has 61798 states and 80742 transitions. Word has length 163 [2019-11-23 22:32:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:17,843 INFO L462 AbstractCegarLoop]: Abstraction has 61798 states and 80742 transitions. [2019-11-23 22:32:17,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:32:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 61798 states and 80742 transitions. [2019-11-23 22:32:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:32:17,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:17,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:32:17,870 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:17,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash -206747585, now seen corresponding path program 1 times [2019-11-23 22:32:17,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:17,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670851202] [2019-11-23 22:32:17,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:17,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670851202] [2019-11-23 22:32:17,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:17,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:17,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285051806] [2019-11-23 22:32:17,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:17,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:17,955 INFO L87 Difference]: Start difference. First operand 61798 states and 80742 transitions. Second operand 3 states. [2019-11-23 22:32:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:23,058 INFO L93 Difference]: Finished difference Result 77318 states and 103995 transitions. [2019-11-23 22:32:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:23,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:32:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:23,108 INFO L225 Difference]: With dead ends: 77318 [2019-11-23 22:32:23,108 INFO L226 Difference]: Without dead ends: 61800 [2019-11-23 22:32:23,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-23 22:32:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61800 states. [2019-11-23 22:32:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61800 to 61618. [2019-11-23 22:32:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61618 states. [2019-11-23 22:32:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61618 states to 61618 states and 80274 transitions. [2019-11-23 22:32:26,852 INFO L78 Accepts]: Start accepts. Automaton has 61618 states and 80274 transitions. Word has length 163 [2019-11-23 22:32:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:26,852 INFO L462 AbstractCegarLoop]: Abstraction has 61618 states and 80274 transitions. [2019-11-23 22:32:26,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 61618 states and 80274 transitions. [2019-11-23 22:32:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:32:26,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:26,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 22:32:26,879 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1718110737, now seen corresponding path program 1 times [2019-11-23 22:32:26,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:26,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229326558] [2019-11-23 22:32:26,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:27,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229326558] [2019-11-23 22:32:27,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:27,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-23 22:32:27,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085020235] [2019-11-23 22:32:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:32:27,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:27,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:32:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:32:27,543 INFO L87 Difference]: Start difference. First operand 61618 states and 80274 transitions. Second operand 16 states.