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_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:12:49,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:12:49,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:12:49,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:12:49,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:12:49,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:12:49,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:12:49,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:12:49,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:12:49,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:12:49,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:12:49,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:12:49,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:12:49,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:12:49,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:12:49,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:12:49,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:12:49,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:12:49,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:12:49,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:12:49,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:12:49,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:12:49,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:12:49,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:12:49,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:12:49,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:12:49,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:12:49,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:12:49,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:12:49,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:12:49,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:12:49,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:12:49,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:12:49,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:12:49,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:12:49,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:12:49,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:12:49,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:12:49,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:12:49,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:12:49,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:12:49,386 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 10:12:49,410 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:12:49,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:12:49,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:12:49,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:12:49,413 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:12:49,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:12:49,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:12:49,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:12:49,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:12:49,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:12:49,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:12:49,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:12:49,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:12:49,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:12:49,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:12:49,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:12:49,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:12:49,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:12:49,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:12:49,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:12:49,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:12:49,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:12:49,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:12:49,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:12:49,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:12:49,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:12:49,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:12:49,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:12:49,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:12:49,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:12:49,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:12:49,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:12:49,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:12:49,485 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:12:49,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:12:49,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf30de07/9f000de21aa04a37970c1727ba1c7bcd/FLAGb1cbec93e [2019-09-08 10:12:50,145 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:12:50,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:12:50,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf30de07/9f000de21aa04a37970c1727ba1c7bcd/FLAGb1cbec93e [2019-09-08 10:12:50,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebf30de07/9f000de21aa04a37970c1727ba1c7bcd [2019-09-08 10:12:50,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:12:50,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:12:50,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:12:50,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:12:50,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:12:50,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:50" (1/1) ... [2019-09-08 10:12:50,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15588d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:50, skipping insertion in model container [2019-09-08 10:12:50,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:50" (1/1) ... [2019-09-08 10:12:50,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:12:50,485 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:12:51,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:12:51,236 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:12:51,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:12:51,577 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:12:51,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51 WrapperNode [2019-09-08 10:12:51,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:12:51,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:12:51,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:12:51,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:12:51,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (1/1) ... [2019-09-08 10:12:51,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:12:51,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:12:51,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:12:51,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:12:51,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (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 10:12:51,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:12:51,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:12:51,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:12:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:12:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:12:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:12:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:12:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:12:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:12:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:12:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:12:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:12:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:12:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:12:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:12:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:12:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:12:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:12:51,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:12:51,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:12:54,355 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:12:54,357 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:12:54,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:12:54 BoogieIcfgContainer [2019-09-08 10:12:54,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:12:54,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:12:54,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:12:54,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:12:54,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:12:50" (1/3) ... [2019-09-08 10:12:54,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e87ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:12:54, skipping insertion in model container [2019-09-08 10:12:54,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:51" (2/3) ... [2019-09-08 10:12:54,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e87ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:12:54, skipping insertion in model container [2019-09-08 10:12:54,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:12:54" (3/3) ... [2019-09-08 10:12:54,370 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 10:12:54,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:12:54,390 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:12:54,407 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:12:54,445 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:12:54,446 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:12:54,446 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:12:54,446 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:12:54,446 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:12:54,446 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:12:54,447 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:12:54,447 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:12:54,447 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:12:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-08 10:12:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 10:12:54,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:54,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:54,510 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 326812692, now seen corresponding path program 1 times [2019-09-08 10:12:54,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:54,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:54,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:54,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:55,303 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 10:12:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:55,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:55,332 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 3 states. [2019-09-08 10:12:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:55,571 INFO L93 Difference]: Finished difference Result 1116 states and 1990 transitions. [2019-09-08 10:12:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:55,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 10:12:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:55,620 INFO L225 Difference]: With dead ends: 1116 [2019-09-08 10:12:55,621 INFO L226 Difference]: Without dead ends: 914 [2019-09-08 10:12:55,629 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 10:12:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-08 10:12:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2019-09-08 10:12:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-08 10:12:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1584 transitions. [2019-09-08 10:12:55,767 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1584 transitions. Word has length 208 [2019-09-08 10:12:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:55,769 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1584 transitions. [2019-09-08 10:12:55,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1584 transitions. [2019-09-08 10:12:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 10:12:55,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:55,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:55,778 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash -749134671, now seen corresponding path program 1 times [2019-09-08 10:12:55,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:55,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:55,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:56,131 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 10:12:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:56,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:56,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:56,142 INFO L87 Difference]: Start difference. First operand 912 states and 1584 transitions. Second operand 3 states. [2019-09-08 10:12:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:56,236 INFO L93 Difference]: Finished difference Result 1620 states and 2776 transitions. [2019-09-08 10:12:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:56,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 10:12:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:56,255 INFO L225 Difference]: With dead ends: 1620 [2019-09-08 10:12:56,255 INFO L226 Difference]: Without dead ends: 1255 [2019-09-08 10:12:56,263 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 10:12:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-08 10:12:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2019-09-08 10:12:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-09-08 10:12:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2156 transitions. [2019-09-08 10:12:56,369 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2156 transitions. Word has length 212 [2019-09-08 10:12:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:56,371 INFO L475 AbstractCegarLoop]: Abstraction has 1253 states and 2156 transitions. [2019-09-08 10:12:56,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2156 transitions. [2019-09-08 10:12:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:12:56,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:56,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:56,385 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1492476271, now seen corresponding path program 1 times [2019-09-08 10:12:56,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:56,762 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 10:12:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:56,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:56,767 INFO L87 Difference]: Start difference. First operand 1253 states and 2156 transitions. Second operand 3 states. [2019-09-08 10:12:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:56,854 INFO L93 Difference]: Finished difference Result 1954 states and 3340 transitions. [2019-09-08 10:12:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:56,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:12:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:56,868 INFO L225 Difference]: With dead ends: 1954 [2019-09-08 10:12:56,870 INFO L226 Difference]: Without dead ends: 1589 [2019-09-08 10:12:56,879 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 10:12:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2019-09-08 10:12:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1587. [2019-09-08 10:12:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-09-08 10:12:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2718 transitions. [2019-09-08 10:12:56,992 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2718 transitions. Word has length 216 [2019-09-08 10:12:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:56,993 INFO L475 AbstractCegarLoop]: Abstraction has 1587 states and 2718 transitions. [2019-09-08 10:12:56,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2718 transitions. [2019-09-08 10:12:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:12:56,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:56,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:56,998 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2071522764, now seen corresponding path program 1 times [2019-09-08 10:12:56,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:56,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:57,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:57,238 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 10:12:57,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:57,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:57,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:57,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:57,240 INFO L87 Difference]: Start difference. First operand 1587 states and 2718 transitions. Second operand 3 states. [2019-09-08 10:12:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:57,346 INFO L93 Difference]: Finished difference Result 3527 states and 5974 transitions. [2019-09-08 10:12:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:57,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:12:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:57,360 INFO L225 Difference]: With dead ends: 3527 [2019-09-08 10:12:57,361 INFO L226 Difference]: Without dead ends: 2524 [2019-09-08 10:12:57,364 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 10:12:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-08 10:12:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2522. [2019-09-08 10:12:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2522 states. [2019-09-08 10:12:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4276 transitions. [2019-09-08 10:12:57,465 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4276 transitions. Word has length 216 [2019-09-08 10:12:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:57,466 INFO L475 AbstractCegarLoop]: Abstraction has 2522 states and 4276 transitions. [2019-09-08 10:12:57,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4276 transitions. [2019-09-08 10:12:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 10:12:57,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:57,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:57,472 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash -108508146, now seen corresponding path program 1 times [2019-09-08 10:12:57,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:57,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:57,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:57,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:57,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:57,724 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 10:12:57,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:57,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:57,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:57,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:57,727 INFO L87 Difference]: Start difference. First operand 2522 states and 4276 transitions. Second operand 3 states. [2019-09-08 10:12:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:57,950 INFO L93 Difference]: Finished difference Result 4376 states and 7394 transitions. [2019-09-08 10:12:57,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:57,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-08 10:12:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:57,976 INFO L225 Difference]: With dead ends: 4376 [2019-09-08 10:12:57,976 INFO L226 Difference]: Without dead ends: 3373 [2019-09-08 10:12:57,982 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 10:12:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-08 10:12:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3371. [2019-09-08 10:12:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3371 states. [2019-09-08 10:12:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 5694 transitions. [2019-09-08 10:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 5694 transitions. Word has length 220 [2019-09-08 10:12:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:58,189 INFO L475 AbstractCegarLoop]: Abstraction has 3371 states and 5694 transitions. [2019-09-08 10:12:58,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 5694 transitions. [2019-09-08 10:12:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 10:12:58,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:58,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:58,194 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 959349905, now seen corresponding path program 1 times [2019-09-08 10:12:58,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:58,399 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 10:12:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:58,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:58,401 INFO L87 Difference]: Start difference. First operand 3371 states and 5694 transitions. Second operand 3 states. [2019-09-08 10:12:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:58,676 INFO L93 Difference]: Finished difference Result 8655 states and 14510 transitions. [2019-09-08 10:12:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:58,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-08 10:12:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:58,720 INFO L225 Difference]: With dead ends: 8655 [2019-09-08 10:12:58,720 INFO L226 Difference]: Without dead ends: 5914 [2019-09-08 10:12:58,797 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 10:12:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-08 10:12:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5912. [2019-09-08 10:12:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2019-09-08 10:12:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 9894 transitions. [2019-09-08 10:12:59,053 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 9894 transitions. Word has length 220 [2019-09-08 10:12:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:59,054 INFO L475 AbstractCegarLoop]: Abstraction has 5912 states and 9894 transitions. [2019-09-08 10:12:59,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 9894 transitions. [2019-09-08 10:12:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 10:12:59,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:59,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:59,059 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 792658975, now seen corresponding path program 1 times [2019-09-08 10:12:59,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:59,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:59,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:59,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:59,247 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 10:12:59,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:59,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:59,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:59,250 INFO L87 Difference]: Start difference. First operand 5912 states and 9894 transitions. Second operand 3 states. [2019-09-08 10:12:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:59,533 INFO L93 Difference]: Finished difference Result 10846 states and 18152 transitions. [2019-09-08 10:12:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:59,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-08 10:12:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:59,609 INFO L225 Difference]: With dead ends: 10846 [2019-09-08 10:12:59,611 INFO L226 Difference]: Without dead ends: 8105 [2019-09-08 10:12:59,623 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 10:12:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2019-09-08 10:12:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 8103. [2019-09-08 10:12:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-09-08 10:13:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13534 transitions. [2019-09-08 10:13:00,015 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13534 transitions. Word has length 224 [2019-09-08 10:13:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:00,016 INFO L475 AbstractCegarLoop]: Abstraction has 8103 states and 13534 transitions. [2019-09-08 10:13:00,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13534 transitions. [2019-09-08 10:13:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 10:13:00,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:00,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:00,021 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1043249236, now seen corresponding path program 1 times [2019-09-08 10:13:00,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:00,271 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 10:13:00,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:00,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:00,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:00,273 INFO L87 Difference]: Start difference. First operand 8103 states and 13534 transitions. Second operand 3 states. [2019-09-08 10:13:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:00,816 INFO L93 Difference]: Finished difference Result 22363 states and 37134 transitions. [2019-09-08 10:13:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:00,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-08 10:13:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:00,852 INFO L225 Difference]: With dead ends: 22363 [2019-09-08 10:13:00,852 INFO L226 Difference]: Without dead ends: 14936 [2019-09-08 10:13:00,868 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 10:13:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14936 states. [2019-09-08 10:13:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14936 to 14934. [2019-09-08 10:13:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14934 states. [2019-09-08 10:13:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14934 states to 14934 states and 24712 transitions. [2019-09-08 10:13:01,402 INFO L78 Accepts]: Start accepts. Automaton has 14934 states and 24712 transitions. Word has length 224 [2019-09-08 10:13:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:01,402 INFO L475 AbstractCegarLoop]: Abstraction has 14934 states and 24712 transitions. [2019-09-08 10:13:01,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14934 states and 24712 transitions. [2019-09-08 10:13:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 10:13:01,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:01,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:01,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1254462577, now seen corresponding path program 1 times [2019-09-08 10:13:01,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:01,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:01,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:01,913 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 10:13:01,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:01,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:13:01,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:13:01,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:13:01,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:13:01,915 INFO L87 Difference]: Start difference. First operand 14934 states and 24712 transitions. Second operand 7 states. [2019-09-08 10:13:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:05,879 INFO L93 Difference]: Finished difference Result 104767 states and 174000 transitions. [2019-09-08 10:13:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:13:05,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-09-08 10:13:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:06,135 INFO L225 Difference]: With dead ends: 104767 [2019-09-08 10:13:06,136 INFO L226 Difference]: Without dead ends: 90509 [2019-09-08 10:13:06,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:13:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90509 states. [2019-09-08 10:13:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90509 to 29107. [2019-09-08 10:13:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29107 states. [2019-09-08 10:13:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29107 states to 29107 states and 47961 transitions. [2019-09-08 10:13:08,380 INFO L78 Accepts]: Start accepts. Automaton has 29107 states and 47961 transitions. Word has length 228 [2019-09-08 10:13:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:08,380 INFO L475 AbstractCegarLoop]: Abstraction has 29107 states and 47961 transitions. [2019-09-08 10:13:08,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:13:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 29107 states and 47961 transitions. [2019-09-08 10:13:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:13:08,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:08,386 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash 162908202, now seen corresponding path program 1 times [2019-09-08 10:13:08,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:08,573 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 10:13:08,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:08,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:08,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:08,575 INFO L87 Difference]: Start difference. First operand 29107 states and 47961 transitions. Second operand 4 states. [2019-09-08 10:13:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:11,040 INFO L93 Difference]: Finished difference Result 79691 states and 131925 transitions. [2019-09-08 10:13:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:13:11,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 10:13:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:11,124 INFO L225 Difference]: With dead ends: 79691 [2019-09-08 10:13:11,124 INFO L226 Difference]: Without dead ends: 51308 [2019-09-08 10:13:11,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:13:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51308 states. [2019-09-08 10:13:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51308 to 43862. [2019-09-08 10:13:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43862 states. [2019-09-08 10:13:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43862 states to 43862 states and 72426 transitions. [2019-09-08 10:13:13,519 INFO L78 Accepts]: Start accepts. Automaton has 43862 states and 72426 transitions. Word has length 229 [2019-09-08 10:13:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:13,520 INFO L475 AbstractCegarLoop]: Abstraction has 43862 states and 72426 transitions. [2019-09-08 10:13:13,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 43862 states and 72426 transitions. [2019-09-08 10:13:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:13:13,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:13,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:13,526 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1006966476, now seen corresponding path program 1 times [2019-09-08 10:13:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:13,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:13,713 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 10:13:13,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:13,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:13,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:13,715 INFO L87 Difference]: Start difference. First operand 43862 states and 72426 transitions. Second operand 3 states. [2019-09-08 10:13:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:17,138 INFO L93 Difference]: Finished difference Result 83756 states and 138614 transitions. [2019-09-08 10:13:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:17,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 10:13:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:17,212 INFO L225 Difference]: With dead ends: 83756 [2019-09-08 10:13:17,213 INFO L226 Difference]: Without dead ends: 61182 [2019-09-08 10:13:17,253 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 10:13:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61182 states. [2019-09-08 10:13:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61182 to 61180. [2019-09-08 10:13:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61180 states. [2019-09-08 10:13:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61180 states to 61180 states and 100889 transitions. [2019-09-08 10:13:19,660 INFO L78 Accepts]: Start accepts. Automaton has 61180 states and 100889 transitions. Word has length 229 [2019-09-08 10:13:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:19,661 INFO L475 AbstractCegarLoop]: Abstraction has 61180 states and 100889 transitions. [2019-09-08 10:13:19,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61180 states and 100889 transitions. [2019-09-08 10:13:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:13:19,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:19,665 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash -791244133, now seen corresponding path program 1 times [2019-09-08 10:13:19,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:19,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:19,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:19,837 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 10:13:19,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:19,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:19,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:19,839 INFO L87 Difference]: Start difference. First operand 61180 states and 100889 transitions. Second operand 3 states. [2019-09-08 10:13:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:24,955 INFO L93 Difference]: Finished difference Result 133884 states and 222089 transitions. [2019-09-08 10:13:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:24,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 10:13:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:25,082 INFO L225 Difference]: With dead ends: 133884 [2019-09-08 10:13:25,083 INFO L226 Difference]: Without dead ends: 92060 [2019-09-08 10:13:25,138 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 10:13:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92060 states. [2019-09-08 10:13:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92060 to 92058. [2019-09-08 10:13:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92058 states. [2019-09-08 10:13:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92058 states to 92058 states and 151940 transitions. [2019-09-08 10:13:28,735 INFO L78 Accepts]: Start accepts. Automaton has 92058 states and 151940 transitions. Word has length 229 [2019-09-08 10:13:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:28,736 INFO L475 AbstractCegarLoop]: Abstraction has 92058 states and 151940 transitions. [2019-09-08 10:13:28,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 92058 states and 151940 transitions. [2019-09-08 10:13:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:13:28,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:28,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:28,739 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash 689018968, now seen corresponding path program 1 times [2019-09-08 10:13:28,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:28,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:28,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:28,946 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 10:13:28,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:28,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:28,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:28,948 INFO L87 Difference]: Start difference. First operand 92058 states and 151940 transitions. Second operand 4 states. [2019-09-08 10:13:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:38,350 INFO L93 Difference]: Finished difference Result 272320 states and 450330 transitions. [2019-09-08 10:13:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:13:38,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-08 10:13:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:38,644 INFO L225 Difference]: With dead ends: 272320 [2019-09-08 10:13:38,644 INFO L226 Difference]: Without dead ends: 180903 [2019-09-08 10:13:38,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:13:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180903 states. [2019-09-08 10:13:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180903 to 151264. [2019-09-08 10:13:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151264 states. [2019-09-08 10:13:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151264 states to 151264 states and 249210 transitions. [2019-09-08 10:13:48,671 INFO L78 Accepts]: Start accepts. Automaton has 151264 states and 249210 transitions. Word has length 230 [2019-09-08 10:13:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:48,671 INFO L475 AbstractCegarLoop]: Abstraction has 151264 states and 249210 transitions. [2019-09-08 10:13:48,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 151264 states and 249210 transitions. [2019-09-08 10:13:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 10:13:48,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:48,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:48,674 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -176858447, now seen corresponding path program 1 times [2019-09-08 10:13:48,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:48,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:48,855 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 10:13:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:48,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:48,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:48,858 INFO L87 Difference]: Start difference. First operand 151264 states and 249210 transitions. Second operand 4 states. [2019-09-08 10:14:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:04,990 INFO L93 Difference]: Finished difference Result 446878 states and 737772 transitions. [2019-09-08 10:14:04,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:04,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 10:14:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:05,533 INFO L225 Difference]: With dead ends: 446878 [2019-09-08 10:14:05,533 INFO L226 Difference]: Without dead ends: 296255 [2019-09-08 10:14:05,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:14:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296255 states. [2019-09-08 10:14:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296255 to 248194. [2019-09-08 10:14:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248194 states. [2019-09-08 10:14:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248194 states to 248194 states and 408192 transitions. [2019-09-08 10:14:23,222 INFO L78 Accepts]: Start accepts. Automaton has 248194 states and 408192 transitions. Word has length 231 [2019-09-08 10:14:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:23,223 INFO L475 AbstractCegarLoop]: Abstraction has 248194 states and 408192 transitions. [2019-09-08 10:14:23,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:14:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 248194 states and 408192 transitions. [2019-09-08 10:14:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 10:14:23,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:23,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:14:23,225 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1244696513, now seen corresponding path program 1 times [2019-09-08 10:14:23,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:23,481 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 10:14:23,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:23,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:14:23,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:14:23,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:14:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:14:23,483 INFO L87 Difference]: Start difference. First operand 248194 states and 408192 transitions. Second operand 4 states. [2019-09-08 10:14:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:53,740 INFO L93 Difference]: Finished difference Result 736225 states and 1213317 transitions. [2019-09-08 10:14:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:14:53,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 10:14:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:54,637 INFO L225 Difference]: With dead ends: 736225 [2019-09-08 10:14:54,637 INFO L226 Difference]: Without dead ends: 488672 [2019-09-08 10:14:54,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:14:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488672 states. [2019-09-08 10:15:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488672 to 405720. [2019-09-08 10:15:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405720 states. [2019-09-08 10:15:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405720 states to 405720 states and 666142 transitions. [2019-09-08 10:15:30,154 INFO L78 Accepts]: Start accepts. Automaton has 405720 states and 666142 transitions. Word has length 232 [2019-09-08 10:15:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:30,154 INFO L475 AbstractCegarLoop]: Abstraction has 405720 states and 666142 transitions. [2019-09-08 10:15:30,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:15:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 405720 states and 666142 transitions. [2019-09-08 10:15:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 10:15:30,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:30,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:30,156 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 16619832, now seen corresponding path program 1 times [2019-09-08 10:15:30,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:30,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:30,451 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 10:15:30,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:30,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:15:30,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:15:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:15:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:15:30,455 INFO L87 Difference]: Start difference. First operand 405720 states and 666142 transitions. Second operand 8 states. [2019-09-08 10:18:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:13,581 INFO L93 Difference]: Finished difference Result 2237226 states and 3686619 transitions. [2019-09-08 10:18:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:18:13,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2019-09-08 10:18:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:17,177 INFO L225 Difference]: With dead ends: 2237226 [2019-09-08 10:18:17,178 INFO L226 Difference]: Without dead ends: 1832147 [2019-09-08 10:18:17,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:18:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832147 states. [2019-09-08 10:20:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832147 to 1110422. [2019-09-08 10:20:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110422 states. [2019-09-08 10:20:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110422 states to 1110422 states and 1815836 transitions. [2019-09-08 10:20:30,703 INFO L78 Accepts]: Start accepts. Automaton has 1110422 states and 1815836 transitions. Word has length 233 [2019-09-08 10:20:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:30,704 INFO L475 AbstractCegarLoop]: Abstraction has 1110422 states and 1815836 transitions. [2019-09-08 10:20:30,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:20:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1110422 states and 1815836 transitions. [2019-09-08 10:20:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 10:20:30,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:30,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:20:30,706 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1597136680, now seen corresponding path program 1 times [2019-09-08 10:20:30,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:30,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:30,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:31,221 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 10:20:31,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:31,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:20:31,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:20:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:20:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:20:31,223 INFO L87 Difference]: Start difference. First operand 1110422 states and 1815836 transitions. Second operand 7 states. [2019-09-08 10:23:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:19,983 INFO L93 Difference]: Finished difference Result 2686663 states and 4398473 transitions. [2019-09-08 10:23:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:23:19,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-08 10:23:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:23,028 INFO L225 Difference]: With dead ends: 2686663 [2019-09-08 10:23:23,028 INFO L226 Difference]: Without dead ends: 1576882 [2019-09-08 10:23:23,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:23:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576882 states.