/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_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:29,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:29,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:29,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:29,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:29,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:29,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:29,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:29,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:29,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:29,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:29,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:29,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:29,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:29,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:29,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:29,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:29,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:29,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:29,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:29,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:29,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:29,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:29,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:29,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:29,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:29,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:29,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:29,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:29,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:29,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:29,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:29,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:29,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:29,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:29,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:29,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:29,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:29,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:29,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:29,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:29,436 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:32:29,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:29,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:29,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:29,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:29,467 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:29,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:29,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:29,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:29,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:29,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:29,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:29,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:29,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:29,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:29,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:29,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:29,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:29,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:29,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:29,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:29,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:29,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:29,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:29,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:29,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:29,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:29,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:29,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:29,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:29,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:29,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:29,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:29,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:29,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:29,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:29,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:32:29,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b934c227b/795c77dc2b3241f78cf87d66d2d7fb6c/FLAG3d0fe19de [2019-11-23 22:32:30,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:30,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:32:30,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b934c227b/795c77dc2b3241f78cf87d66d2d7fb6c/FLAG3d0fe19de [2019-11-23 22:32:30,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b934c227b/795c77dc2b3241f78cf87d66d2d7fb6c [2019-11-23 22:32:30,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:30,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:30,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:30,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:30,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:30,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e7c61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:30, skipping insertion in model container [2019-11-23 22:32:30,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:30,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:31,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,457 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:31,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,973 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:31,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31 WrapperNode [2019-11-23 22:32:31,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:31,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:31,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:31,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:31,984 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:32:31" (1/1) ... [2019-11-23 22:32:32,025 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:32:31" (1/1) ... [2019-11-23 22:32:32,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:32,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:32,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:32,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:32,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:32,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:32,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:32,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:32,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:32,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (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:32:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:32,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:34,333 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:34,333 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:34,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:34 BoogieIcfgContainer [2019-11-23 22:32:34,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:34,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:34,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:34,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:34,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:30" (1/3) ... [2019-11-23 22:32:34,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cde4726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:34, skipping insertion in model container [2019-11-23 22:32:34,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (2/3) ... [2019-11-23 22:32:34,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cde4726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:34, skipping insertion in model container [2019-11-23 22:32:34,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:34" (3/3) ... [2019-11-23 22:32:34,346 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:32:34,357 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:34,367 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-23 22:32:34,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-23 22:32:34,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:34,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:34,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:34,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:34,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:34,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:34,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:34,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states. [2019-11-23 22:32:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:32:34,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:34,481 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] [2019-11-23 22:32:34,482 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 881754525, now seen corresponding path program 1 times [2019-11-23 22:32:34,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:34,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001961234] [2019-11-23 22:32:34,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:34,822 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:34,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001961234] [2019-11-23 22:32:34,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:34,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:34,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95354768] [2019-11-23 22:32:34,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:34,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:34,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:34,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:34,847 INFO L87 Difference]: Start difference. First operand 442 states. Second operand 3 states. [2019-11-23 22:32:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:34,987 INFO L93 Difference]: Finished difference Result 690 states and 1215 transitions. [2019-11-23 22:32:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:34,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:32:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:35,021 INFO L225 Difference]: With dead ends: 690 [2019-11-23 22:32:35,021 INFO L226 Difference]: Without dead ends: 546 [2019-11-23 22:32:35,029 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:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-23 22:32:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 540. [2019-11-23 22:32:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-23 22:32:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 715 transitions. [2019-11-23 22:32:35,140 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 715 transitions. Word has length 50 [2019-11-23 22:32:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:35,140 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 715 transitions. [2019-11-23 22:32:35,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 715 transitions. [2019-11-23 22:32:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:32:35,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:35,150 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] [2019-11-23 22:32:35,150 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -88586633, now seen corresponding path program 1 times [2019-11-23 22:32:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145653839] [2019-11-23 22:32:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:35,330 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:35,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145653839] [2019-11-23 22:32:35,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:35,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090295758] [2019-11-23 22:32:35,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:35,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:35,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:35,335 INFO L87 Difference]: Start difference. First operand 540 states and 715 transitions. Second operand 3 states. [2019-11-23 22:32:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:35,413 INFO L93 Difference]: Finished difference Result 955 states and 1317 transitions. [2019-11-23 22:32:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:35,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:32:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:35,420 INFO L225 Difference]: With dead ends: 955 [2019-11-23 22:32:35,421 INFO L226 Difference]: Without dead ends: 714 [2019-11-23 22:32:35,427 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:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-23 22:32:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 708. [2019-11-23 22:32:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-11-23 22:32:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 953 transitions. [2019-11-23 22:32:35,472 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 953 transitions. Word has length 50 [2019-11-23 22:32:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:35,473 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 953 transitions. [2019-11-23 22:32:35,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 953 transitions. [2019-11-23 22:32:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:32:35,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:35,478 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] [2019-11-23 22:32:35,478 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash 301591798, now seen corresponding path program 1 times [2019-11-23 22:32:35,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:35,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705007312] [2019-11-23 22:32:35,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:35,664 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:35,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705007312] [2019-11-23 22:32:35,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:35,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:35,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565598776] [2019-11-23 22:32:35,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:35,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:35,669 INFO L87 Difference]: Start difference. First operand 708 states and 953 transitions. Second operand 3 states. [2019-11-23 22:32:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:35,772 INFO L93 Difference]: Finished difference Result 1364 states and 1888 transitions. [2019-11-23 22:32:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:35,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:32:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:35,781 INFO L225 Difference]: With dead ends: 1364 [2019-11-23 22:32:35,781 INFO L226 Difference]: Without dead ends: 1035 [2019-11-23 22:32:35,783 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:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-11-23 22:32:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1028. [2019-11-23 22:32:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-23 22:32:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1397 transitions. [2019-11-23 22:32:35,823 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1397 transitions. Word has length 50 [2019-11-23 22:32:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:35,825 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1397 transitions. [2019-11-23 22:32:35,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1397 transitions. [2019-11-23 22:32:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:32:35,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:35,834 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] [2019-11-23 22:32:35,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash 157307916, now seen corresponding path program 1 times [2019-11-23 22:32:35,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:35,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600519579] [2019-11-23 22:32:35,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:36,039 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:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600519579] [2019-11-23 22:32:36,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:36,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:32:36,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972182246] [2019-11-23 22:32:36,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:32:36,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:36,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:32:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:32:36,042 INFO L87 Difference]: Start difference. First operand 1028 states and 1397 transitions. Second operand 11 states. [2019-11-23 22:32:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:38,545 INFO L93 Difference]: Finished difference Result 3231 states and 4493 transitions. [2019-11-23 22:32:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:32:38,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-11-23 22:32:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:38,566 INFO L225 Difference]: With dead ends: 3231 [2019-11-23 22:32:38,566 INFO L226 Difference]: Without dead ends: 3014 [2019-11-23 22:32:38,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:32:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-11-23 22:32:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1039. [2019-11-23 22:32:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-11-23 22:32:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1411 transitions. [2019-11-23 22:32:38,718 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1411 transitions. Word has length 50 [2019-11-23 22:32:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:38,719 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 1411 transitions. [2019-11-23 22:32:38,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:32:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1411 transitions. [2019-11-23 22:32:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:38,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:38,722 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] [2019-11-23 22:32:38,722 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:38,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1701829494, now seen corresponding path program 1 times [2019-11-23 22:32:38,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:38,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856799412] [2019-11-23 22:32:38,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:38,955 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:38,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856799412] [2019-11-23 22:32:38,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:38,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:32:38,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483009994] [2019-11-23 22:32:38,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:32:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:32:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:32:38,958 INFO L87 Difference]: Start difference. First operand 1039 states and 1411 transitions. Second operand 12 states. [2019-11-23 22:32:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:41,777 INFO L93 Difference]: Finished difference Result 3263 states and 4562 transitions. [2019-11-23 22:32:41,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:32:41,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-23 22:32:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:41,793 INFO L225 Difference]: With dead ends: 3263 [2019-11-23 22:32:41,793 INFO L226 Difference]: Without dead ends: 3064 [2019-11-23 22:32:41,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:32:41,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2019-11-23 22:32:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 1055. [2019-11-23 22:32:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-11-23 22:32:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1434 transitions. [2019-11-23 22:32:41,891 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1434 transitions. Word has length 51 [2019-11-23 22:32:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:41,891 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1434 transitions. [2019-11-23 22:32:41,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:32:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1434 transitions. [2019-11-23 22:32:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:41,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:41,894 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] [2019-11-23 22:32:41,894 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 606637426, now seen corresponding path program 1 times [2019-11-23 22:32:41,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:41,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140986619] [2019-11-23 22:32:41,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:42,076 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:42,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140986619] [2019-11-23 22:32:42,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:42,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:32:42,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066513624] [2019-11-23 22:32:42,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:32:42,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:42,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:32:42,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:32:42,078 INFO L87 Difference]: Start difference. First operand 1055 states and 1434 transitions. Second operand 13 states. [2019-11-23 22:32:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:47,341 INFO L93 Difference]: Finished difference Result 5652 states and 7904 transitions. [2019-11-23 22:32:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-23 22:32:47,341 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-23 22:32:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:47,367 INFO L225 Difference]: With dead ends: 5652 [2019-11-23 22:32:47,367 INFO L226 Difference]: Without dead ends: 5375 [2019-11-23 22:32:47,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=602, Invalid=1654, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 22:32:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2019-11-23 22:32:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 1076. [2019-11-23 22:32:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-23 22:32:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1461 transitions. [2019-11-23 22:32:47,505 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1461 transitions. Word has length 51 [2019-11-23 22:32:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:47,506 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1461 transitions. [2019-11-23 22:32:47,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:32:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1461 transitions. [2019-11-23 22:32:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:47,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:47,508 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] [2019-11-23 22:32:47,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1311651063, now seen corresponding path program 1 times [2019-11-23 22:32:47,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:47,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214517352] [2019-11-23 22:32:47,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:47,660 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:47,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214517352] [2019-11-23 22:32:47,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:47,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:32:47,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191174277] [2019-11-23 22:32:47,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:32:47,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:32:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:32:47,665 INFO L87 Difference]: Start difference. First operand 1076 states and 1461 transitions. Second operand 12 states. [2019-11-23 22:32:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:55,382 INFO L93 Difference]: Finished difference Result 15908 states and 22975 transitions. [2019-11-23 22:32:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-23 22:32:55,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-23 22:32:55,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:55,444 INFO L225 Difference]: With dead ends: 15908 [2019-11-23 22:32:55,444 INFO L226 Difference]: Without dead ends: 15175 [2019-11-23 22:32:55,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1274, Invalid=4578, Unknown=0, NotChecked=0, Total=5852 [2019-11-23 22:32:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15175 states. [2019-11-23 22:32:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15175 to 4091. [2019-11-23 22:32:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4091 states. [2019-11-23 22:32:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 5832 transitions. [2019-11-23 22:32:56,109 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 5832 transitions. Word has length 51 [2019-11-23 22:32:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:56,110 INFO L462 AbstractCegarLoop]: Abstraction has 4091 states and 5832 transitions. [2019-11-23 22:32:56,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:32:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 5832 transitions. [2019-11-23 22:32:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:56,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:56,115 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] [2019-11-23 22:32:56,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1045338420, now seen corresponding path program 1 times [2019-11-23 22:32:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:56,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295876088] [2019-11-23 22:32:56,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:56,229 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:56,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295876088] [2019-11-23 22:32:56,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:56,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:56,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906798340] [2019-11-23 22:32:56,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:56,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:56,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:56,231 INFO L87 Difference]: Start difference. First operand 4091 states and 5832 transitions. Second operand 9 states. [2019-11-23 22:32:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:59,052 INFO L93 Difference]: Finished difference Result 9680 states and 13865 transitions. [2019-11-23 22:32:59,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:32:59,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-23 22:32:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:59,070 INFO L225 Difference]: With dead ends: 9680 [2019-11-23 22:32:59,070 INFO L226 Difference]: Without dead ends: 9455 [2019-11-23 22:32:59,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9455 states. [2019-11-23 22:32:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9455 to 4102. [2019-11-23 22:32:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-23 22:32:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5846 transitions. [2019-11-23 22:32:59,596 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5846 transitions. Word has length 51 [2019-11-23 22:32:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:59,597 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5846 transitions. [2019-11-23 22:32:59,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5846 transitions. [2019-11-23 22:32:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:32:59,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:59,601 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] [2019-11-23 22:32:59,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1906241974, now seen corresponding path program 1 times [2019-11-23 22:32:59,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:59,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120469627] [2019-11-23 22:32:59,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:59,696 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:59,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120469627] [2019-11-23 22:32:59,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:59,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277877879] [2019-11-23 22:32:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:59,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:59,698 INFO L87 Difference]: Start difference. First operand 4102 states and 5846 transitions. Second operand 9 states. [2019-11-23 22:33:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:01,777 INFO L93 Difference]: Finished difference Result 6619 states and 9465 transitions. [2019-11-23 22:33:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:33:01,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-23 22:33:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:01,790 INFO L225 Difference]: With dead ends: 6619 [2019-11-23 22:33:01,791 INFO L226 Difference]: Without dead ends: 6402 [2019-11-23 22:33:01,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:33:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2019-11-23 22:33:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 4102. [2019-11-23 22:33:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-23 22:33:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5846 transitions. [2019-11-23 22:33:02,373 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5846 transitions. Word has length 51 [2019-11-23 22:33:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:02,373 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5846 transitions. [2019-11-23 22:33:02,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5846 transitions. [2019-11-23 22:33:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:02,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:02,377 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] [2019-11-23 22:33:02,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:02,378 INFO L82 PathProgramCache]: Analyzing trace with hash 824761644, now seen corresponding path program 1 times [2019-11-23 22:33:02,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:02,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801566586] [2019-11-23 22:33:02,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:02,521 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:33:02,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801566586] [2019-11-23 22:33:02,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:33:02,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406281137] [2019-11-23 22:33:02,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:33:02,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:33:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:33:02,524 INFO L87 Difference]: Start difference. First operand 4102 states and 5846 transitions. Second operand 11 states. [2019-11-23 22:33:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:07,504 INFO L93 Difference]: Finished difference Result 15850 states and 22824 transitions. [2019-11-23 22:33:07,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:33:07,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-11-23 22:33:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:07,522 INFO L225 Difference]: With dead ends: 15850 [2019-11-23 22:33:07,522 INFO L226 Difference]: Without dead ends: 14821 [2019-11-23 22:33:07,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=643, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:33:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14821 states. [2019-11-23 22:33:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14821 to 4102. [2019-11-23 22:33:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-23 22:33:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5846 transitions. [2019-11-23 22:33:08,398 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5846 transitions. Word has length 52 [2019-11-23 22:33:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:08,398 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5846 transitions. [2019-11-23 22:33:08,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:33:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5846 transitions. [2019-11-23 22:33:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:08,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:08,402 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] [2019-11-23 22:33:08,403 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 473809540, now seen corresponding path program 1 times [2019-11-23 22:33:08,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:08,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83629002] [2019-11-23 22:33:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:08,492 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:33:08,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83629002] [2019-11-23 22:33:08,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:08,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:08,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151601019] [2019-11-23 22:33:08,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:08,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:08,495 INFO L87 Difference]: Start difference. First operand 4102 states and 5846 transitions. Second operand 9 states. [2019-11-23 22:33:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:10,722 INFO L93 Difference]: Finished difference Result 9610 states and 13844 transitions. [2019-11-23 22:33:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:10,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-23 22:33:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:10,731 INFO L225 Difference]: With dead ends: 9610 [2019-11-23 22:33:10,732 INFO L226 Difference]: Without dead ends: 6608 [2019-11-23 22:33:10,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2019-11-23 22:33:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 2540. [2019-11-23 22:33:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2540 states. [2019-11-23 22:33:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3579 transitions. [2019-11-23 22:33:11,251 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3579 transitions. Word has length 52 [2019-11-23 22:33:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:11,251 INFO L462 AbstractCegarLoop]: Abstraction has 2540 states and 3579 transitions. [2019-11-23 22:33:11,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3579 transitions. [2019-11-23 22:33:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:11,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:11,254 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] [2019-11-23 22:33:11,254 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1531194475, now seen corresponding path program 1 times [2019-11-23 22:33:11,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:11,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338932792] [2019-11-23 22:33:11,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:11,362 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:33:11,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338932792] [2019-11-23 22:33:11,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:11,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:11,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362650661] [2019-11-23 22:33:11,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:11,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:11,364 INFO L87 Difference]: Start difference. First operand 2540 states and 3579 transitions. Second operand 10 states. [2019-11-23 22:33:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:15,040 INFO L93 Difference]: Finished difference Result 8662 states and 12228 transitions. [2019-11-23 22:33:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:33:15,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-23 22:33:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:15,047 INFO L225 Difference]: With dead ends: 8662 [2019-11-23 22:33:15,047 INFO L226 Difference]: Without dead ends: 7867 [2019-11-23 22:33:15,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2019-11-23 22:33:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 2554. [2019-11-23 22:33:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-11-23 22:33:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3597 transitions. [2019-11-23 22:33:15,454 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3597 transitions. Word has length 52 [2019-11-23 22:33:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:15,454 INFO L462 AbstractCegarLoop]: Abstraction has 2554 states and 3597 transitions. [2019-11-23 22:33:15,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3597 transitions. [2019-11-23 22:33:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:15,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:15,456 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] [2019-11-23 22:33:15,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -387094014, now seen corresponding path program 1 times [2019-11-23 22:33:15,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:15,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893379989] [2019-11-23 22:33:15,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:15,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:33:15,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893379989] [2019-11-23 22:33:15,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:15,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:15,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402988582] [2019-11-23 22:33:15,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:15,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:15,549 INFO L87 Difference]: Start difference. First operand 2554 states and 3597 transitions. Second operand 9 states. [2019-11-23 22:33:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:18,702 INFO L93 Difference]: Finished difference Result 11150 states and 16020 transitions. [2019-11-23 22:33:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:18,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-23 22:33:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:18,711 INFO L225 Difference]: With dead ends: 11150 [2019-11-23 22:33:18,711 INFO L226 Difference]: Without dead ends: 9122 [2019-11-23 22:33:18,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2019-11-23 22:33:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 5541. [2019-11-23 22:33:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5541 states. [2019-11-23 22:33:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7955 transitions. [2019-11-23 22:33:19,716 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7955 transitions. Word has length 52 [2019-11-23 22:33:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:19,716 INFO L462 AbstractCegarLoop]: Abstraction has 5541 states and 7955 transitions. [2019-11-23 22:33:19,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7955 transitions. [2019-11-23 22:33:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:19,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:19,719 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] [2019-11-23 22:33:19,719 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1048140228, now seen corresponding path program 1 times [2019-11-23 22:33:19,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:19,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294153215] [2019-11-23 22:33:19,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:19,814 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:33:19,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294153215] [2019-11-23 22:33:19,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:19,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:33:19,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926957973] [2019-11-23 22:33:19,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:33:19,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:33:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:19,817 INFO L87 Difference]: Start difference. First operand 5541 states and 7955 transitions. Second operand 8 states. [2019-11-23 22:33:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:25,918 INFO L93 Difference]: Finished difference Result 25905 states and 37920 transitions. [2019-11-23 22:33:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:33:25,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-23 22:33:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:25,937 INFO L225 Difference]: With dead ends: 25905 [2019-11-23 22:33:25,937 INFO L226 Difference]: Without dead ends: 21698 [2019-11-23 22:33:25,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:33:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21698 states. [2019-11-23 22:33:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21698 to 12635. [2019-11-23 22:33:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12635 states. [2019-11-23 22:33:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12635 states to 12635 states and 18432 transitions. [2019-11-23 22:33:28,446 INFO L78 Accepts]: Start accepts. Automaton has 12635 states and 18432 transitions. Word has length 52 [2019-11-23 22:33:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:28,446 INFO L462 AbstractCegarLoop]: Abstraction has 12635 states and 18432 transitions. [2019-11-23 22:33:28,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:33:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12635 states and 18432 transitions. [2019-11-23 22:33:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:28,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:28,452 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] [2019-11-23 22:33:28,452 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash 870148261, now seen corresponding path program 1 times [2019-11-23 22:33:28,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:28,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12725033] [2019-11-23 22:33:28,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:28,566 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:33:28,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12725033] [2019-11-23 22:33:28,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:28,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:28,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126988979] [2019-11-23 22:33:28,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:28,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:28,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:28,568 INFO L87 Difference]: Start difference. First operand 12635 states and 18432 transitions. Second operand 10 states. [2019-11-23 22:33:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:41,079 INFO L93 Difference]: Finished difference Result 47248 states and 68151 transitions. [2019-11-23 22:33:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:33:41,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-23 22:33:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:41,118 INFO L225 Difference]: With dead ends: 47248 [2019-11-23 22:33:41,118 INFO L226 Difference]: Without dead ends: 40977 [2019-11-23 22:33:41,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40977 states. [2019-11-23 22:33:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40977 to 12649. [2019-11-23 22:33:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2019-11-23 22:33:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 18450 transitions. [2019-11-23 22:33:43,905 INFO L78 Accepts]: Start accepts. Automaton has 12649 states and 18450 transitions. Word has length 52 [2019-11-23 22:33:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:43,906 INFO L462 AbstractCegarLoop]: Abstraction has 12649 states and 18450 transitions. [2019-11-23 22:33:43,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 12649 states and 18450 transitions. [2019-11-23 22:33:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:43,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:43,909 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] [2019-11-23 22:33:43,909 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -347521520, now seen corresponding path program 1 times [2019-11-23 22:33:43,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:43,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676856555] [2019-11-23 22:33:43,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:43,978 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:33:43,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676856555] [2019-11-23 22:33:43,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:43,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:33:43,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261108770] [2019-11-23 22:33:43,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:33:43,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:33:43,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:33:43,983 INFO L87 Difference]: Start difference. First operand 12649 states and 18450 transitions. Second operand 8 states. [2019-11-23 22:33:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:51,525 INFO L93 Difference]: Finished difference Result 30308 states and 44268 transitions. [2019-11-23 22:33:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:33:51,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-23 22:33:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:51,548 INFO L225 Difference]: With dead ends: 30308 [2019-11-23 22:33:51,548 INFO L226 Difference]: Without dead ends: 24825 [2019-11-23 22:33:51,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:33:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24825 states. [2019-11-23 22:33:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24825 to 12671. [2019-11-23 22:33:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12671 states. [2019-11-23 22:33:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12671 states to 12671 states and 18481 transitions. [2019-11-23 22:33:54,235 INFO L78 Accepts]: Start accepts. Automaton has 12671 states and 18481 transitions. Word has length 52 [2019-11-23 22:33:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:54,236 INFO L462 AbstractCegarLoop]: Abstraction has 12671 states and 18481 transitions. [2019-11-23 22:33:54,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:33:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12671 states and 18481 transitions. [2019-11-23 22:33:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:33:54,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:54,240 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] [2019-11-23 22:33:54,240 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1198562519, now seen corresponding path program 1 times [2019-11-23 22:33:54,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:54,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037722330] [2019-11-23 22:33:54,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:54,308 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:33:54,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037722330] [2019-11-23 22:33:54,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:54,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:33:54,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858444115] [2019-11-23 22:33:54,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:33:54,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:54,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:33:54,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:54,310 INFO L87 Difference]: Start difference. First operand 12671 states and 18481 transitions. Second operand 7 states.