java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:08:23,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:08:23,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:08:23,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:08:23,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:08:23,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:08:23,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:08:23,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:08:23,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:08:23,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:08:23,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:08:23,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:08:23,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:08:23,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:08:23,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:08:23,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:08:23,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:08:23,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:08:23,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:08:23,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:08:23,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:08:23,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:08:23,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:08:23,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:08:23,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:08:23,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:08:23,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:08:23,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:08:23,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:08:23,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:08:23,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:08:23,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:08:23,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:08:23,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:08:23,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:08:23,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:08:23,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:08:23,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:08:23,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:08:23,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:08:23,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:08:23,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:08:23,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:08:23,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:08:23,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:08:23,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:08:23,199 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:08:23,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:08:23,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:08:23,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:08:23,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:08:23,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:08:23,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:08:23,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:08:23,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:08:23,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:08:23,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:08:23,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:08:23,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:08:23,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:08:23,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:08:23,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:08:23,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:08:23,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:08:23,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:08:23,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:08:23,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:08:23,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:08:23,203 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:08:23,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:08:23,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:08:23,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:08:23,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:08:23,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:08:23,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:08:23,249 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:08:23,250 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.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 11:08:23,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9255d0fb/ff4d7be7ebb74155b7a1e5abeb43a1ab/FLAG3920abf27 [2019-09-08 11:08:24,445 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:08:24,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 11:08:24,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9255d0fb/ff4d7be7ebb74155b7a1e5abeb43a1ab/FLAG3920abf27 [2019-09-08 11:08:24,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9255d0fb/ff4d7be7ebb74155b7a1e5abeb43a1ab [2019-09-08 11:08:24,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:08:24,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:08:24,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:08:24,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:08:24,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:08:24,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:08:24" (1/1) ... [2019-09-08 11:08:24,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1640135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:24, skipping insertion in model container [2019-09-08 11:08:24,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:08:24" (1/1) ... [2019-09-08 11:08:24,652 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:08:25,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:08:28,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:08:28,101 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:08:29,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:08:29,852 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:08:29,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29 WrapperNode [2019-09-08 11:08:29,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:08:29,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:08:29,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:08:29,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:08:29,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:29,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:29,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:29,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:30,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:30,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:30,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... [2019-09-08 11:08:30,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:08:30,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:08:30,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:08:30,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:08:30,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:08:30,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:08:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:08:30,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:08:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:08:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:08:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:08:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:08:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:08:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:08:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:08:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:08:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:08:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:08:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:08:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:08:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:08:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:08:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:08:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:08:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:08:45,101 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:08:45,101 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:08:45,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:08:45 BoogieIcfgContainer [2019-09-08 11:08:45,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:08:45,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:08:45,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:08:45,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:08:45,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:08:24" (1/3) ... [2019-09-08 11:08:45,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e07e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:08:45, skipping insertion in model container [2019-09-08 11:08:45,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:08:29" (2/3) ... [2019-09-08 11:08:45,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e07e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:08:45, skipping insertion in model container [2019-09-08 11:08:45,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:08:45" (3/3) ... [2019-09-08 11:08:45,117 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-08 11:08:45,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:08:45,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-09-08 11:08:45,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-09-08 11:08:45,245 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:08:45,246 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:08:45,246 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:08:45,246 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:08:45,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:08:45,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:08:45,247 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:08:45,247 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:08:45,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:08:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states. [2019-09-08 11:08:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:08:45,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:45,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:45,428 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1809486584, now seen corresponding path program 1 times [2019-09-08 11:08:45,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:45,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:08:46,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:08:46,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:08:46,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:08:46,560 INFO L87 Difference]: Start difference. First operand 6351 states. Second operand 5 states. [2019-09-08 11:08:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:53,782 INFO L93 Difference]: Finished difference Result 9417 states and 16419 transitions. [2019-09-08 11:08:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:08:53,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 11:08:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:53,837 INFO L225 Difference]: With dead ends: 9417 [2019-09-08 11:08:53,838 INFO L226 Difference]: Without dead ends: 5988 [2019-09-08 11:08:53,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:08:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2019-09-08 11:08:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 5955. [2019-09-08 11:08:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5955 states. [2019-09-08 11:08:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5955 states to 5955 states and 7689 transitions. [2019-09-08 11:08:54,148 INFO L78 Accepts]: Start accepts. Automaton has 5955 states and 7689 transitions. Word has length 82 [2019-09-08 11:08:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:54,149 INFO L475 AbstractCegarLoop]: Abstraction has 5955 states and 7689 transitions. [2019-09-08 11:08:54,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:08:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5955 states and 7689 transitions. [2019-09-08 11:08:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:08:54,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:54,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:54,166 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 806830495, now seen corresponding path program 1 times [2019-09-08 11:08:54,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:54,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:54,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:54,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:08:54,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:08:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:08:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:08:54,669 INFO L87 Difference]: Start difference. First operand 5955 states and 7689 transitions. Second operand 5 states. [2019-09-08 11:09:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:01,884 INFO L93 Difference]: Finished difference Result 11861 states and 15475 transitions. [2019-09-08 11:09:01,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:01,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:09:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:01,922 INFO L225 Difference]: With dead ends: 11861 [2019-09-08 11:09:01,923 INFO L226 Difference]: Without dead ends: 7982 [2019-09-08 11:09:01,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2019-09-08 11:09:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 7958. [2019-09-08 11:09:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7958 states. [2019-09-08 11:09:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 10316 transitions. [2019-09-08 11:09:02,227 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 10316 transitions. Word has length 83 [2019-09-08 11:09:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:02,227 INFO L475 AbstractCegarLoop]: Abstraction has 7958 states and 10316 transitions. [2019-09-08 11:09:02,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:09:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 10316 transitions. [2019-09-08 11:09:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:09:02,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:02,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:02,250 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 116069294, now seen corresponding path program 1 times [2019-09-08 11:09:02,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:02,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:09:02,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:09:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:09:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:09:02,793 INFO L87 Difference]: Start difference. First operand 7958 states and 10316 transitions. Second operand 9 states. [2019-09-08 11:09:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:14,943 INFO L93 Difference]: Finished difference Result 8740 states and 11340 transitions. [2019-09-08 11:09:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:09:14,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 11:09:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:14,982 INFO L225 Difference]: With dead ends: 8740 [2019-09-08 11:09:14,983 INFO L226 Difference]: Without dead ends: 8734 [2019-09-08 11:09:14,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:09:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2019-09-08 11:09:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 7958. [2019-09-08 11:09:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7958 states. [2019-09-08 11:09:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 10315 transitions. [2019-09-08 11:09:15,300 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 10315 transitions. Word has length 84 [2019-09-08 11:09:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:15,300 INFO L475 AbstractCegarLoop]: Abstraction has 7958 states and 10315 transitions. [2019-09-08 11:09:15,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:09:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 10315 transitions. [2019-09-08 11:09:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:09:15,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:15,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:15,318 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1112489822, now seen corresponding path program 1 times [2019-09-08 11:09:15,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:15,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:15,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:09:15,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:09:15,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:09:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:09:15,654 INFO L87 Difference]: Start difference. First operand 7958 states and 10315 transitions. Second operand 5 states. [2019-09-08 11:09:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:21,434 INFO L93 Difference]: Finished difference Result 15436 states and 19977 transitions. [2019-09-08 11:09:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:21,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:09:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:21,475 INFO L225 Difference]: With dead ends: 15436 [2019-09-08 11:09:21,475 INFO L226 Difference]: Without dead ends: 9921 [2019-09-08 11:09:21,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9921 states. [2019-09-08 11:09:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 9893. [2019-09-08 11:09:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9893 states. [2019-09-08 11:09:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9893 states to 9893 states and 12601 transitions. [2019-09-08 11:09:21,992 INFO L78 Accepts]: Start accepts. Automaton has 9893 states and 12601 transitions. Word has length 84 [2019-09-08 11:09:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:21,993 INFO L475 AbstractCegarLoop]: Abstraction has 9893 states and 12601 transitions. [2019-09-08 11:09:21,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:09:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9893 states and 12601 transitions. [2019-09-08 11:09:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:09:22,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:22,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:22,026 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash 480483016, now seen corresponding path program 1 times [2019-09-08 11:09:22,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:22,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:22,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:22,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:09:22,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:09:22,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:09:22,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:09:22,328 INFO L87 Difference]: Start difference. First operand 9893 states and 12601 transitions. Second operand 5 states. [2019-09-08 11:09:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:27,169 INFO L93 Difference]: Finished difference Result 17830 states and 22802 transitions. [2019-09-08 11:09:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:27,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 11:09:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:27,201 INFO L225 Difference]: With dead ends: 17830 [2019-09-08 11:09:27,202 INFO L226 Difference]: Without dead ends: 11736 [2019-09-08 11:09:27,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11736 states. [2019-09-08 11:09:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11736 to 11705. [2019-09-08 11:09:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11705 states. [2019-09-08 11:09:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11705 states to 11705 states and 15011 transitions. [2019-09-08 11:09:27,649 INFO L78 Accepts]: Start accepts. Automaton has 11705 states and 15011 transitions. Word has length 84 [2019-09-08 11:09:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:27,649 INFO L475 AbstractCegarLoop]: Abstraction has 11705 states and 15011 transitions. [2019-09-08 11:09:27,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:09:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11705 states and 15011 transitions. [2019-09-08 11:09:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:09:27,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:27,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:27,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2076071052, now seen corresponding path program 1 times [2019-09-08 11:09:27,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:28,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-09-08 11:09:28,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:28,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:09:28,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:09:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:09:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:09:28,310 INFO L87 Difference]: Start difference. First operand 11705 states and 15011 transitions. Second operand 12 states. [2019-09-08 11:09:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:36,403 INFO L93 Difference]: Finished difference Result 49810 states and 70956 transitions. [2019-09-08 11:09:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:09:36,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2019-09-08 11:09:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:36,505 INFO L225 Difference]: With dead ends: 49810 [2019-09-08 11:09:36,506 INFO L226 Difference]: Without dead ends: 48083 [2019-09-08 11:09:36,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:09:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48083 states. [2019-09-08 11:09:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48083 to 11596. [2019-09-08 11:09:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-09-08 11:09:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 14868 transitions. [2019-09-08 11:09:37,686 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 14868 transitions. Word has length 85 [2019-09-08 11:09:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:37,686 INFO L475 AbstractCegarLoop]: Abstraction has 11596 states and 14868 transitions. [2019-09-08 11:09:37,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:09:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 14868 transitions. [2019-09-08 11:09:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:09:37,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:37,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:37,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash -531745965, now seen corresponding path program 1 times [2019-09-08 11:09:37,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:37,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:37,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:09:37,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:09:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:09:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:09:37,977 INFO L87 Difference]: Start difference. First operand 11596 states and 14868 transitions. Second operand 6 states. [2019-09-08 11:09:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:43,995 INFO L93 Difference]: Finished difference Result 27035 states and 35150 transitions. [2019-09-08 11:09:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:44,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-08 11:09:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:44,040 INFO L225 Difference]: With dead ends: 27035 [2019-09-08 11:09:44,040 INFO L226 Difference]: Without dead ends: 19819 [2019-09-08 11:09:44,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:09:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-09-08 11:09:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 19787. [2019-09-08 11:09:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19787 states. [2019-09-08 11:09:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19787 states to 19787 states and 25702 transitions. [2019-09-08 11:09:45,388 INFO L78 Accepts]: Start accepts. Automaton has 19787 states and 25702 transitions. Word has length 85 [2019-09-08 11:09:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:45,388 INFO L475 AbstractCegarLoop]: Abstraction has 19787 states and 25702 transitions. [2019-09-08 11:09:45,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:09:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 19787 states and 25702 transitions. [2019-09-08 11:09:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:09:45,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:45,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:45,400 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748461, now seen corresponding path program 1 times [2019-09-08 11:09:45,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:46,082 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2019-09-08 11:09:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:09:46,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:09:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:09:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:09:46,141 INFO L87 Difference]: Start difference. First operand 19787 states and 25702 transitions. Second operand 10 states. [2019-09-08 11:10:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:03,830 INFO L93 Difference]: Finished difference Result 59316 states and 83620 transitions. [2019-09-08 11:10:03,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:10:03,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-09-08 11:10:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:03,907 INFO L225 Difference]: With dead ends: 59316 [2019-09-08 11:10:03,908 INFO L226 Difference]: Without dead ends: 54429 [2019-09-08 11:10:03,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:10:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54429 states. [2019-09-08 11:10:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54429 to 19794. [2019-09-08 11:10:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19794 states. [2019-09-08 11:10:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19794 states to 19794 states and 25709 transitions. [2019-09-08 11:10:07,355 INFO L78 Accepts]: Start accepts. Automaton has 19794 states and 25709 transitions. Word has length 85 [2019-09-08 11:10:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:07,356 INFO L475 AbstractCegarLoop]: Abstraction has 19794 states and 25709 transitions. [2019-09-08 11:10:07,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:10:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19794 states and 25709 transitions. [2019-09-08 11:10:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:10:07,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:07,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:07,368 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash 535565163, now seen corresponding path program 1 times [2019-09-08 11:10:07,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:07,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:07,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:07,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:07,588 INFO L87 Difference]: Start difference. First operand 19794 states and 25709 transitions. Second operand 3 states. [2019-09-08 11:10:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:10,029 INFO L93 Difference]: Finished difference Result 40103 states and 52614 transitions. [2019-09-08 11:10:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:10,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 11:10:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:10,064 INFO L225 Difference]: With dead ends: 40103 [2019-09-08 11:10:10,065 INFO L226 Difference]: Without dead ends: 24581 [2019-09-08 11:10:10,096 INFO L628 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-09-08 11:10:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2019-09-08 11:10:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 24552. [2019-09-08 11:10:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2019-09-08 11:10:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 31844 transitions. [2019-09-08 11:10:12,172 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 31844 transitions. Word has length 86 [2019-09-08 11:10:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:12,172 INFO L475 AbstractCegarLoop]: Abstraction has 24552 states and 31844 transitions. [2019-09-08 11:10:12,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:10:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 31844 transitions. [2019-09-08 11:10:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:10:12,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:12,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:12,185 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1761080908, now seen corresponding path program 1 times [2019-09-08 11:10:12,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:12,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:12,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:12,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:13,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:10:13,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:10:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:10:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:10:13,082 INFO L87 Difference]: Start difference. First operand 24552 states and 31844 transitions. Second operand 13 states. [2019-09-08 11:10:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:28,293 INFO L93 Difference]: Finished difference Result 90898 states and 130348 transitions. [2019-09-08 11:10:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:10:28,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-09-08 11:10:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:28,380 INFO L225 Difference]: With dead ends: 90898 [2019-09-08 11:10:28,381 INFO L226 Difference]: Without dead ends: 76000 [2019-09-08 11:10:28,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:10:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76000 states. [2019-09-08 11:10:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76000 to 23647. [2019-09-08 11:10:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23647 states. [2019-09-08 11:10:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23647 states to 23647 states and 31555 transitions. [2019-09-08 11:10:31,189 INFO L78 Accepts]: Start accepts. Automaton has 23647 states and 31555 transitions. Word has length 86 [2019-09-08 11:10:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:31,189 INFO L475 AbstractCegarLoop]: Abstraction has 23647 states and 31555 transitions. [2019-09-08 11:10:31,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:10:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23647 states and 31555 transitions. [2019-09-08 11:10:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:10:31,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:31,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:31,198 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:31,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash 14480584, now seen corresponding path program 1 times [2019-09-08 11:10:31,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:31,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:10:31,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:10:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:10:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:10:31,571 INFO L87 Difference]: Start difference. First operand 23647 states and 31555 transitions. Second operand 10 states. [2019-09-08 11:10:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:51,133 INFO L93 Difference]: Finished difference Result 90205 states and 129938 transitions. [2019-09-08 11:10:51,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:10:51,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:10:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:51,241 INFO L225 Difference]: With dead ends: 90205 [2019-09-08 11:10:51,241 INFO L226 Difference]: Without dead ends: 79801 [2019-09-08 11:10:51,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:10:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79801 states. [2019-09-08 11:10:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79801 to 23617. [2019-09-08 11:10:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23617 states. [2019-09-08 11:10:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23617 states to 23617 states and 31520 transitions. [2019-09-08 11:10:54,567 INFO L78 Accepts]: Start accepts. Automaton has 23617 states and 31520 transitions. Word has length 87 [2019-09-08 11:10:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:54,567 INFO L475 AbstractCegarLoop]: Abstraction has 23617 states and 31520 transitions. [2019-09-08 11:10:54,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:10:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23617 states and 31520 transitions. [2019-09-08 11:10:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:10:54,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:54,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:54,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -415911719, now seen corresponding path program 1 times [2019-09-08 11:10:54,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:54,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:54,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:54,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:54,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:10:54,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:10:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:10:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:10:54,891 INFO L87 Difference]: Start difference. First operand 23617 states and 31520 transitions. Second operand 9 states. [2019-09-08 11:11:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:07,344 INFO L93 Difference]: Finished difference Result 42591 states and 58756 transitions. [2019-09-08 11:11:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:11:07,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:11:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:07,389 INFO L225 Difference]: With dead ends: 42591 [2019-09-08 11:11:07,389 INFO L226 Difference]: Without dead ends: 42582 [2019-09-08 11:11:07,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:11:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42582 states. [2019-09-08 11:11:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42582 to 23617. [2019-09-08 11:11:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23617 states. [2019-09-08 11:11:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23617 states to 23617 states and 31519 transitions. [2019-09-08 11:11:10,513 INFO L78 Accepts]: Start accepts. Automaton has 23617 states and 31519 transitions. Word has length 87 [2019-09-08 11:11:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:10,513 INFO L475 AbstractCegarLoop]: Abstraction has 23617 states and 31519 transitions. [2019-09-08 11:11:10,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:11:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 23617 states and 31519 transitions. [2019-09-08 11:11:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:11:10,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:10,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:10,522 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash 134643284, now seen corresponding path program 1 times [2019-09-08 11:11:10,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:10,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:11:10,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:11:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:11:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:11:10,886 INFO L87 Difference]: Start difference. First operand 23617 states and 31519 transitions. Second operand 10 states. [2019-09-08 11:11:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:28,964 INFO L93 Difference]: Finished difference Result 65623 states and 94174 transitions. [2019-09-08 11:11:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:11:28,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-08 11:11:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:29,030 INFO L225 Difference]: With dead ends: 65623 [2019-09-08 11:11:29,030 INFO L226 Difference]: Without dead ends: 54848 [2019-09-08 11:11:29,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:11:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54848 states. [2019-09-08 11:11:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54848 to 23218. [2019-09-08 11:11:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23218 states. [2019-09-08 11:11:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23218 states to 23218 states and 31044 transitions. [2019-09-08 11:11:32,371 INFO L78 Accepts]: Start accepts. Automaton has 23218 states and 31044 transitions. Word has length 88 [2019-09-08 11:11:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:32,371 INFO L475 AbstractCegarLoop]: Abstraction has 23218 states and 31044 transitions. [2019-09-08 11:11:32,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:11:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23218 states and 31044 transitions. [2019-09-08 11:11:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:11:32,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:32,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:32,380 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1646972436, now seen corresponding path program 1 times [2019-09-08 11:11:32,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:32,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:32,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:32,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:33,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-09-08 11:11:33,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:33,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:11:33,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:11:33,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:11:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:11:33,825 INFO L87 Difference]: Start difference. First operand 23218 states and 31044 transitions. Second operand 19 states. [2019-09-08 11:11:34,005 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 11:11:34,610 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 11:11:34,775 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 11:11:35,082 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 11:11:35,456 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:11:36,400 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-08 11:11:36,833 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-09-08 11:11:37,179 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 11:11:37,593 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 11:11:38,031 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-08 11:11:38,505 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-08 11:11:40,741 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-08 11:11:41,668 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 11:11:42,199 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 11:11:50,172 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 11:11:51,832 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 11:11:52,777 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 11:11:59,709 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 11:12:00,164 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:12:01,425 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:12:01,870 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 11:12:02,874 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 11:12:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:09,480 INFO L93 Difference]: Finished difference Result 89371 states and 129960 transitions. [2019-09-08 11:12:09,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 11:12:09,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2019-09-08 11:12:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:09,577 INFO L225 Difference]: With dead ends: 89371 [2019-09-08 11:12:09,578 INFO L226 Difference]: Without dead ends: 89367 [2019-09-08 11:12:09,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=543, Invalid=1809, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 11:12:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89367 states. [2019-09-08 11:12:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89367 to 23214. [2019-09-08 11:12:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23214 states. [2019-09-08 11:12:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23214 states to 23214 states and 31040 transitions. [2019-09-08 11:12:15,071 INFO L78 Accepts]: Start accepts. Automaton has 23214 states and 31040 transitions. Word has length 88 [2019-09-08 11:12:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:15,071 INFO L475 AbstractCegarLoop]: Abstraction has 23214 states and 31040 transitions. [2019-09-08 11:12:15,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:12:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 23214 states and 31040 transitions. [2019-09-08 11:12:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:12:15,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:15,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:12:15,081 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2058209277, now seen corresponding path program 1 times [2019-09-08 11:12:15,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:15,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:15,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:15,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:12:15,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:12:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:12:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:12:15,690 INFO L87 Difference]: Start difference. First operand 23214 states and 31040 transitions. Second operand 13 states. [2019-09-08 11:12:16,172 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-08 11:12:16,316 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:16,486 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:16,870 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:12:17,252 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-08 11:12:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:37,091 INFO L93 Difference]: Finished difference Result 88530 states and 128093 transitions. [2019-09-08 11:12:37,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:12:37,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-08 11:12:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:37,180 INFO L225 Difference]: With dead ends: 88530 [2019-09-08 11:12:37,180 INFO L226 Difference]: Without dead ends: 78096 [2019-09-08 11:12:37,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:12:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78096 states. [2019-09-08 11:12:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78096 to 23150. [2019-09-08 11:12:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:12:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30970 transitions. [2019-09-08 11:12:41,986 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30970 transitions. Word has length 88 [2019-09-08 11:12:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:41,987 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30970 transitions. [2019-09-08 11:12:41,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:12:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30970 transitions. [2019-09-08 11:12:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:12:41,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:41,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:12:41,997 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 250696717, now seen corresponding path program 1 times [2019-09-08 11:12:41,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:41,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:42,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:42,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:12:42,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:12:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:12:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:12:42,309 INFO L87 Difference]: Start difference. First operand 23150 states and 30970 transitions. Second operand 9 states. [2019-09-08 11:12:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:59,124 INFO L93 Difference]: Finished difference Result 51579 states and 73264 transitions. [2019-09-08 11:12:59,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:12:59,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:12:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:59,176 INFO L225 Difference]: With dead ends: 51579 [2019-09-08 11:12:59,176 INFO L226 Difference]: Without dead ends: 41203 [2019-09-08 11:12:59,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:12:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41203 states. [2019-09-08 11:13:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41203 to 23150. [2019-09-08 11:13:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:13:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30969 transitions. [2019-09-08 11:13:03,701 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30969 transitions. Word has length 89 [2019-09-08 11:13:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:03,701 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30969 transitions. [2019-09-08 11:13:03,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:13:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30969 transitions. [2019-09-08 11:13:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:13:03,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:03,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:03,713 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash -736885635, now seen corresponding path program 1 times [2019-09-08 11:13:03,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:03,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:03,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:03,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:13:04,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:13:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:13:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:13:04,014 INFO L87 Difference]: Start difference. First operand 23150 states and 30969 transitions. Second operand 9 states. [2019-09-08 11:13:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:28,286 INFO L93 Difference]: Finished difference Result 78921 states and 113134 transitions. [2019-09-08 11:13:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:13:28,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:13:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:28,366 INFO L225 Difference]: With dead ends: 78921 [2019-09-08 11:13:28,366 INFO L226 Difference]: Without dead ends: 68523 [2019-09-08 11:13:28,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:13:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68523 states. [2019-09-08 11:13:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68523 to 23150. [2019-09-08 11:13:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:13:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30968 transitions. [2019-09-08 11:13:33,504 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30968 transitions. Word has length 89 [2019-09-08 11:13:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:33,505 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30968 transitions. [2019-09-08 11:13:33,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:13:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30968 transitions. [2019-09-08 11:13:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:13:33,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:33,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:33,515 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1720334733, now seen corresponding path program 1 times [2019-09-08 11:13:33,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:33,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:33,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:33,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:13:33,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:13:33,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:13:33,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:13:33,787 INFO L87 Difference]: Start difference. First operand 23150 states and 30968 transitions. Second operand 9 states. [2019-09-08 11:14:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:04,296 INFO L93 Difference]: Finished difference Result 92541 states and 134695 transitions. [2019-09-08 11:14:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:14:04,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:14:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:04,392 INFO L225 Difference]: With dead ends: 92541 [2019-09-08 11:14:04,392 INFO L226 Difference]: Without dead ends: 82028 [2019-09-08 11:14:04,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:14:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82028 states. [2019-09-08 11:14:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82028 to 23150. [2019-09-08 11:14:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:14:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30967 transitions. [2019-09-08 11:14:09,818 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30967 transitions. Word has length 89 [2019-09-08 11:14:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:09,818 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30967 transitions. [2019-09-08 11:14:09,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:14:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30967 transitions. [2019-09-08 11:14:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:09,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:09,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:09,830 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:09,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1295666299, now seen corresponding path program 1 times [2019-09-08 11:14:09,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:09,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:09,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:09,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:09,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:10,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:10,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:14:10,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:14:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:14:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:14:10,213 INFO L87 Difference]: Start difference. First operand 23150 states and 30967 transitions. Second operand 9 states. [2019-09-08 11:14:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:28,283 INFO L93 Difference]: Finished difference Result 44045 states and 61916 transitions. [2019-09-08 11:14:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:14:28,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:14:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:28,336 INFO L225 Difference]: With dead ends: 44045 [2019-09-08 11:14:28,336 INFO L226 Difference]: Without dead ends: 44034 [2019-09-08 11:14:28,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:14:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44034 states. [2019-09-08 11:14:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44034 to 23150. [2019-09-08 11:14:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:14:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30966 transitions. [2019-09-08 11:14:33,399 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30966 transitions. Word has length 89 [2019-09-08 11:14:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:33,400 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30966 transitions. [2019-09-08 11:14:33,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:14:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30966 transitions. [2019-09-08 11:14:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:33,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:33,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:33,410 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:33,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1217226200, now seen corresponding path program 1 times [2019-09-08 11:14:33,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:33,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:33,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:33,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:33,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:14:33,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:14:33,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:14:33,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:14:33,767 INFO L87 Difference]: Start difference. First operand 23150 states and 30966 transitions. Second operand 10 states. [2019-09-08 11:15:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:06,324 INFO L93 Difference]: Finished difference Result 89996 states and 129693 transitions. [2019-09-08 11:15:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:15:06,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:15:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:06,417 INFO L225 Difference]: With dead ends: 89996 [2019-09-08 11:15:06,417 INFO L226 Difference]: Without dead ends: 79328 [2019-09-08 11:15:06,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:15:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79328 states. [2019-09-08 11:15:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79328 to 23150. [2019-09-08 11:15:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-08 11:15:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30965 transitions. [2019-09-08 11:15:12,110 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30965 transitions. Word has length 89 [2019-09-08 11:15:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:12,110 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30965 transitions. [2019-09-08 11:15:12,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:15:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30965 transitions. [2019-09-08 11:15:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:12,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:12,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:12,122 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1849091349, now seen corresponding path program 1 times [2019-09-08 11:15:12,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:12,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:12,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:12,319 INFO L87 Difference]: Start difference. First operand 23150 states and 30965 transitions. Second operand 3 states. [2019-09-08 11:15:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:19,827 INFO L93 Difference]: Finished difference Result 39570 states and 55615 transitions. [2019-09-08 11:15:19,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:19,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:15:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:19,861 INFO L225 Difference]: With dead ends: 39570 [2019-09-08 11:15:19,862 INFO L226 Difference]: Without dead ends: 27871 [2019-09-08 11:15:19,877 INFO L628 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-09-08 11:15:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27871 states. [2019-09-08 11:15:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27871 to 23032. [2019-09-08 11:15:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23032 states. [2019-09-08 11:15:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23032 states to 23032 states and 31569 transitions. [2019-09-08 11:15:26,207 INFO L78 Accepts]: Start accepts. Automaton has 23032 states and 31569 transitions. Word has length 90 [2019-09-08 11:15:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:26,208 INFO L475 AbstractCegarLoop]: Abstraction has 23032 states and 31569 transitions. [2019-09-08 11:15:26,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23032 states and 31569 transitions. [2019-09-08 11:15:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:26,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:26,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:26,217 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -172421632, now seen corresponding path program 1 times [2019-09-08 11:15:26,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:26,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:26,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:26,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:26,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:26,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:26,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:26,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:26,418 INFO L87 Difference]: Start difference. First operand 23032 states and 31569 transitions. Second operand 3 states. [2019-09-08 11:15:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:38,019 INFO L93 Difference]: Finished difference Result 47814 states and 68488 transitions. [2019-09-08 11:15:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:38,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:15:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:38,060 INFO L225 Difference]: With dead ends: 47814 [2019-09-08 11:15:38,060 INFO L226 Difference]: Without dead ends: 33575 [2019-09-08 11:15:38,076 INFO L628 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-09-08 11:15:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33575 states. [2019-09-08 11:15:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33575 to 28131. [2019-09-08 11:15:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28131 states. [2019-09-08 11:15:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28131 states to 28131 states and 39545 transitions. [2019-09-08 11:15:47,509 INFO L78 Accepts]: Start accepts. Automaton has 28131 states and 39545 transitions. Word has length 90 [2019-09-08 11:15:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:47,509 INFO L475 AbstractCegarLoop]: Abstraction has 28131 states and 39545 transitions. [2019-09-08 11:15:47,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28131 states and 39545 transitions. [2019-09-08 11:15:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:47,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:47,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:47,518 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 10411893, now seen corresponding path program 1 times [2019-09-08 11:15:47,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:47,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:47,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:47,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:47,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:47,719 INFO L87 Difference]: Start difference. First operand 28131 states and 39545 transitions. Second operand 3 states. [2019-09-08 11:16:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:05,457 INFO L93 Difference]: Finished difference Result 70452 states and 100943 transitions. [2019-09-08 11:16:05,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:16:05,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:16:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:05,522 INFO L225 Difference]: With dead ends: 70452 [2019-09-08 11:16:05,522 INFO L226 Difference]: Without dead ends: 48635 [2019-09-08 11:16:05,549 INFO L628 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-09-08 11:16:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2019-09-08 11:16:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 48621. [2019-09-08 11:16:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48621 states. [2019-09-08 11:16:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48621 states to 48621 states and 68498 transitions. [2019-09-08 11:16:24,813 INFO L78 Accepts]: Start accepts. Automaton has 48621 states and 68498 transitions. Word has length 90 [2019-09-08 11:16:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:24,813 INFO L475 AbstractCegarLoop]: Abstraction has 48621 states and 68498 transitions. [2019-09-08 11:16:24,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:16:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 48621 states and 68498 transitions. [2019-09-08 11:16:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:16:24,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:24,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:16:24,824 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 905473228, now seen corresponding path program 1 times [2019-09-08 11:16:24,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:24,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:24,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:25,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:25,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:16:25,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:16:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:16:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:16:25,207 INFO L87 Difference]: Start difference. First operand 48621 states and 68498 transitions. Second operand 10 states. [2019-09-08 11:17:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:19,387 INFO L93 Difference]: Finished difference Result 114511 states and 163597 transitions. [2019-09-08 11:17:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:17:19,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-08 11:17:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:19,586 INFO L225 Difference]: With dead ends: 114511 [2019-09-08 11:17:19,587 INFO L226 Difference]: Without dead ends: 112325 [2019-09-08 11:17:19,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:17:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112325 states. [2019-09-08 11:17:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112325 to 48621. [2019-09-08 11:17:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48621 states. [2019-09-08 11:17:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48621 states to 48621 states and 68496 transitions. [2019-09-08 11:17:39,611 INFO L78 Accepts]: Start accepts. Automaton has 48621 states and 68496 transitions. Word has length 90 [2019-09-08 11:17:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:39,611 INFO L475 AbstractCegarLoop]: Abstraction has 48621 states and 68496 transitions. [2019-09-08 11:17:39,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:17:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 48621 states and 68496 transitions. [2019-09-08 11:17:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:17:39,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:39,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:39,622 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:39,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1584363060, now seen corresponding path program 1 times [2019-09-08 11:17:39,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:39,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:17:40,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:40,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:17:40,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:17:40,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:17:40,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:17:40,268 INFO L87 Difference]: Start difference. First operand 48621 states and 68496 transitions. Second operand 13 states. [2019-09-08 11:17:40,793 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-08 11:17:40,983 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-08 11:17:41,220 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-08 11:17:42,218 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-08 11:17:42,649 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-08 11:18:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:53,006 INFO L93 Difference]: Finished difference Result 156984 states and 225748 transitions. [2019-09-08 11:18:53,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:18:53,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-08 11:18:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:53,232 INFO L225 Difference]: With dead ends: 156984 [2019-09-08 11:18:53,232 INFO L226 Difference]: Without dead ends: 156970 [2019-09-08 11:18:53,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:18:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156970 states. [2019-09-08 11:19:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156970 to 48607. [2019-09-08 11:19:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48607 states. [2019-09-08 11:19:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48607 states to 48607 states and 68482 transitions. [2019-09-08 11:19:14,750 INFO L78 Accepts]: Start accepts. Automaton has 48607 states and 68482 transitions. Word has length 90 [2019-09-08 11:19:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:14,751 INFO L475 AbstractCegarLoop]: Abstraction has 48607 states and 68482 transitions. [2019-09-08 11:19:14,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:19:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48607 states and 68482 transitions. [2019-09-08 11:19:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:19:14,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:14,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:14,766 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1472650956, now seen corresponding path program 1 times [2019-09-08 11:19:14,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:14,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:15,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:15,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:19:15,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:19:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:19:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:19:15,066 INFO L87 Difference]: Start difference. First operand 48607 states and 68482 transitions. Second operand 9 states. [2019-09-08 11:20:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:22,768 INFO L93 Difference]: Finished difference Result 139555 states and 199986 transitions. [2019-09-08 11:20:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:20:22,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-08 11:20:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:22,951 INFO L225 Difference]: With dead ends: 139555 [2019-09-08 11:20:22,952 INFO L226 Difference]: Without dead ends: 131649 [2019-09-08 11:20:22,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:20:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131649 states. [2019-09-08 11:20:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131649 to 48575. [2019-09-08 11:20:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48575 states. [2019-09-08 11:20:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48575 states to 48575 states and 68443 transitions. [2019-09-08 11:20:42,374 INFO L78 Accepts]: Start accepts. Automaton has 48575 states and 68443 transitions. Word has length 90 [2019-09-08 11:20:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:42,374 INFO L475 AbstractCegarLoop]: Abstraction has 48575 states and 68443 transitions. [2019-09-08 11:20:42,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:20:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 48575 states and 68443 transitions. [2019-09-08 11:20:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:20:42,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:42,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:42,386 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1635857145, now seen corresponding path program 1 times [2019-09-08 11:20:42,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:42,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:42,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:20:42,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:42,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:20:42,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:20:42,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:20:42,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:20:42,633 INFO L87 Difference]: Start difference. First operand 48575 states and 68443 transitions. Second operand 9 states.