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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:08:57,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:08:57,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:08:57,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:08:57,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:08:57,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:08:57,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:08:57,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:08:57,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:08:57,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:08:57,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:08:57,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:08:57,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:08:57,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:08:57,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:08:57,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:08:57,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:08:57,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:08:57,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:08:57,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:08:57,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:08:57,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:08:57,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:08:57,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:08:57,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:08:57,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:08:57,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:08:57,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:08:57,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:08:57,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:08:57,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:08:57,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:08:57,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:08:57,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:08:57,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:08:57,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:08:57,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:08:57,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:08:57,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:08:57,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:08:57,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:08:57,434 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 13:08:57,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:08:57,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:08:57,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:08:57,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:08:57,450 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:08:57,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:08:57,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:08:57,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:08:57,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:08:57,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:08:57,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:08:57,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:08:57,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:08:57,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:08:57,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:08:57,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:08:57,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:08:57,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:08:57,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:08:57,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:08:57,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:08:57,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:08:57,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:08:57,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:08:57,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:08:57,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:08:57,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:08:57,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:08:57,500 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:08:57,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:08:57,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a0cc73f/23d324b5d4b3437fab557a8af70f4371/FLAG70f3167b1 [2019-09-08 13:08:58,226 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:08:58,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:08:58,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a0cc73f/23d324b5d4b3437fab557a8af70f4371/FLAG70f3167b1 [2019-09-08 13:08:58,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a0cc73f/23d324b5d4b3437fab557a8af70f4371 [2019-09-08 13:08:58,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:08:58,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:08:58,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:08:58,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:08:58,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:08:58,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:58" (1/1) ... [2019-09-08 13:08:58,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:08:58, skipping insertion in model container [2019-09-08 13:08:58,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:08:58" (1/1) ... [2019-09-08 13:08:58,368 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:08:58,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:08:59,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:08:59,956 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:09:00,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:09:00,967 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:09:00,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00 WrapperNode [2019-09-08 13:09:00,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:09:00,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:09:00,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:09:00,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:09:00,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:00,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (1/1) ... [2019-09-08 13:09:01,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:09:01,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:09:01,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:09:01,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:09:01,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (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 13:09:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:09:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:09:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:09:01,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:09:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:09:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:09:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:09:01,214 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:09:01,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:09:01,215 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:09:01,215 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:09:01,216 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:09:01,216 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:09:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:09:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:09:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:09:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:09:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:09:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:09:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:09:04,799 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:09:04,800 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:09:04,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:09:04 BoogieIcfgContainer [2019-09-08 13:09:04,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:09:04,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:09:04,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:09:04,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:09:04,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:08:58" (1/3) ... [2019-09-08 13:09:04,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678ffa36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:09:04, skipping insertion in model container [2019-09-08 13:09:04,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:09:00" (2/3) ... [2019-09-08 13:09:04,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678ffa36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:09:04, skipping insertion in model container [2019-09-08 13:09:04,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:09:04" (3/3) ... [2019-09-08 13:09:04,811 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:09:04,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:09:04,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:09:04,847 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:09:04,884 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:09:04,885 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:09:04,885 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:09:04,885 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:09:04,885 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:09:04,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:09:04,886 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:09:04,886 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:09:04,886 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:09:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states. [2019-09-08 13:09:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:09:04,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:04,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:04,953 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1980660841, now seen corresponding path program 1 times [2019-09-08 13:09:04,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:04,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:05,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:06,030 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 13:09:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:06,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:06,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:06,057 INFO L87 Difference]: Start difference. First operand 1004 states. Second operand 3 states. [2019-09-08 13:09:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:06,469 INFO L93 Difference]: Finished difference Result 1763 states and 3121 transitions. [2019-09-08 13:09:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:06,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:09:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:06,507 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 13:09:06,507 INFO L226 Difference]: Without dead ends: 1457 [2019-09-08 13:09:06,518 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 13:09:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-09-08 13:09:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1455. [2019-09-08 13:09:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-09-08 13:09:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2235 transitions. [2019-09-08 13:09:06,670 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2235 transitions. Word has length 312 [2019-09-08 13:09:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:06,675 INFO L475 AbstractCegarLoop]: Abstraction has 1455 states and 2235 transitions. [2019-09-08 13:09:06,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2235 transitions. [2019-09-08 13:09:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:09:06,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:06,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:06,692 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:06,694 INFO L82 PathProgramCache]: Analyzing trace with hash 122735285, now seen corresponding path program 1 times [2019-09-08 13:09:06,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:06,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:06,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:06,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:06,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:07,192 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 13:09:07,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:07,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:07,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:07,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:07,198 INFO L87 Difference]: Start difference. First operand 1455 states and 2235 transitions. Second operand 3 states. [2019-09-08 13:09:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:07,469 INFO L93 Difference]: Finished difference Result 2804 states and 4353 transitions. [2019-09-08 13:09:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:07,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-08 13:09:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:07,484 INFO L225 Difference]: With dead ends: 2804 [2019-09-08 13:09:07,485 INFO L226 Difference]: Without dead ends: 2369 [2019-09-08 13:09:07,489 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 13:09:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-09-08 13:09:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2367. [2019-09-08 13:09:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-09-08 13:09:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3653 transitions. [2019-09-08 13:09:07,616 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3653 transitions. Word has length 312 [2019-09-08 13:09:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:07,617 INFO L475 AbstractCegarLoop]: Abstraction has 2367 states and 3653 transitions. [2019-09-08 13:09:07,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3653 transitions. [2019-09-08 13:09:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 13:09:07,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:07,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:07,630 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1622377659, now seen corresponding path program 1 times [2019-09-08 13:09:07,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:08,816 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 13:09:08,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:08,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:08,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:08,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:08,819 INFO L87 Difference]: Start difference. First operand 2367 states and 3653 transitions. Second operand 4 states. [2019-09-08 13:09:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:09,135 INFO L93 Difference]: Finished difference Result 6990 states and 10776 transitions. [2019-09-08 13:09:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:09,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 13:09:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:09,159 INFO L225 Difference]: With dead ends: 6990 [2019-09-08 13:09:09,159 INFO L226 Difference]: Without dead ends: 4638 [2019-09-08 13:09:09,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2019-09-08 13:09:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4534. [2019-09-08 13:09:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4534 states. [2019-09-08 13:09:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 6986 transitions. [2019-09-08 13:09:09,364 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 6986 transitions. Word has length 312 [2019-09-08 13:09:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:09,364 INFO L475 AbstractCegarLoop]: Abstraction has 4534 states and 6986 transitions. [2019-09-08 13:09:09,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 6986 transitions. [2019-09-08 13:09:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:09:09,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:09,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:09,377 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1163281230, now seen corresponding path program 1 times [2019-09-08 13:09:09,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:09,590 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 13:09:09,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:09,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:09,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:09,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:09,592 INFO L87 Difference]: Start difference. First operand 4534 states and 6986 transitions. Second operand 3 states. [2019-09-08 13:09:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:09,948 INFO L93 Difference]: Finished difference Result 13557 states and 20887 transitions. [2019-09-08 13:09:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:09,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:09:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:09,994 INFO L225 Difference]: With dead ends: 13557 [2019-09-08 13:09:09,994 INFO L226 Difference]: Without dead ends: 9048 [2019-09-08 13:09:10,006 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 13:09:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9048 states. [2019-09-08 13:09:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9048 to 4547. [2019-09-08 13:09:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4547 states. [2019-09-08 13:09:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 7005 transitions. [2019-09-08 13:09:10,267 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 7005 transitions. Word has length 314 [2019-09-08 13:09:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:10,268 INFO L475 AbstractCegarLoop]: Abstraction has 4547 states and 7005 transitions. [2019-09-08 13:09:10,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 7005 transitions. [2019-09-08 13:09:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 13:09:10,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:10,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:10,280 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -542730167, now seen corresponding path program 1 times [2019-09-08 13:09:10,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:10,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:10,636 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 13:09:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:10,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:10,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:10,639 INFO L87 Difference]: Start difference. First operand 4547 states and 7005 transitions. Second operand 3 states. [2019-09-08 13:09:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:11,276 INFO L93 Difference]: Finished difference Result 13314 states and 20462 transitions. [2019-09-08 13:09:11,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:11,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 13:09:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:11,334 INFO L225 Difference]: With dead ends: 13314 [2019-09-08 13:09:11,335 INFO L226 Difference]: Without dead ends: 8909 [2019-09-08 13:09:11,347 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 13:09:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8909 states. [2019-09-08 13:09:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8909 to 8805. [2019-09-08 13:09:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8805 states. [2019-09-08 13:09:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8805 states to 8805 states and 13515 transitions. [2019-09-08 13:09:11,746 INFO L78 Accepts]: Start accepts. Automaton has 8805 states and 13515 transitions. Word has length 314 [2019-09-08 13:09:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:11,746 INFO L475 AbstractCegarLoop]: Abstraction has 8805 states and 13515 transitions. [2019-09-08 13:09:11,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8805 states and 13515 transitions. [2019-09-08 13:09:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 13:09:11,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:11,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:11,766 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -186969393, now seen corresponding path program 1 times [2019-09-08 13:09:11,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:11,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:11,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:11,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:11,973 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 13:09:11,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:11,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:11,975 INFO L87 Difference]: Start difference. First operand 8805 states and 13515 transitions. Second operand 3 states. [2019-09-08 13:09:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:12,837 INFO L93 Difference]: Finished difference Result 26302 states and 40358 transitions. [2019-09-08 13:09:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:12,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-08 13:09:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:12,880 INFO L225 Difference]: With dead ends: 26302 [2019-09-08 13:09:12,881 INFO L226 Difference]: Without dead ends: 17557 [2019-09-08 13:09:12,903 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 13:09:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17557 states. [2019-09-08 13:09:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17557 to 8823. [2019-09-08 13:09:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-09-08 13:09:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 13536 transitions. [2019-09-08 13:09:13,544 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 13536 transitions. Word has length 315 [2019-09-08 13:09:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:13,545 INFO L475 AbstractCegarLoop]: Abstraction has 8823 states and 13536 transitions. [2019-09-08 13:09:13,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 13536 transitions. [2019-09-08 13:09:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:09:13,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:13,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:13,567 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:13,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1296376036, now seen corresponding path program 1 times [2019-09-08 13:09:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:13,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:13,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:13,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:13,973 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 13:09:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:13,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:13,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:13,976 INFO L87 Difference]: Start difference. First operand 8823 states and 13536 transitions. Second operand 3 states. [2019-09-08 13:09:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:14,806 INFO L93 Difference]: Finished difference Result 24886 states and 38078 transitions. [2019-09-08 13:09:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:14,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 13:09:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:14,844 INFO L225 Difference]: With dead ends: 24886 [2019-09-08 13:09:14,844 INFO L226 Difference]: Without dead ends: 16308 [2019-09-08 13:09:14,866 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 13:09:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16308 states. [2019-09-08 13:09:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16308 to 16204. [2019-09-08 13:09:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16204 states. [2019-09-08 13:09:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16204 states to 16204 states and 24709 transitions. [2019-09-08 13:09:16,261 INFO L78 Accepts]: Start accepts. Automaton has 16204 states and 24709 transitions. Word has length 316 [2019-09-08 13:09:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:16,262 INFO L475 AbstractCegarLoop]: Abstraction has 16204 states and 24709 transitions. [2019-09-08 13:09:16,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16204 states and 24709 transitions. [2019-09-08 13:09:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 13:09:16,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:16,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:16,294 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 364671809, now seen corresponding path program 1 times [2019-09-08 13:09:16,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:16,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:16,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:16,710 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 13:09:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:16,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:16,712 INFO L87 Difference]: Start difference. First operand 16204 states and 24709 transitions. Second operand 4 states. [2019-09-08 13:09:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:18,362 INFO L93 Difference]: Finished difference Result 46660 states and 70952 transitions. [2019-09-08 13:09:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:18,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-08 13:09:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:18,432 INFO L225 Difference]: With dead ends: 46660 [2019-09-08 13:09:18,432 INFO L226 Difference]: Without dead ends: 30996 [2019-09-08 13:09:18,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30996 states. [2019-09-08 13:09:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30996 to 16439. [2019-09-08 13:09:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16439 states. [2019-09-08 13:09:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16439 states to 16439 states and 25097 transitions. [2019-09-08 13:09:19,470 INFO L78 Accepts]: Start accepts. Automaton has 16439 states and 25097 transitions. Word has length 316 [2019-09-08 13:09:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:19,470 INFO L475 AbstractCegarLoop]: Abstraction has 16439 states and 25097 transitions. [2019-09-08 13:09:19,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 16439 states and 25097 transitions. [2019-09-08 13:09:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:09:19,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:19,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:19,502 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1310214227, now seen corresponding path program 1 times [2019-09-08 13:09:19,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:19,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:19,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:19,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:19,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:19,793 INFO L87 Difference]: Start difference. First operand 16439 states and 25097 transitions. Second operand 3 states. [2019-09-08 13:09:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:20,869 INFO L93 Difference]: Finished difference Result 40139 states and 61610 transitions. [2019-09-08 13:09:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:20,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:09:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:20,934 INFO L225 Difference]: With dead ends: 40139 [2019-09-08 13:09:20,934 INFO L226 Difference]: Without dead ends: 25359 [2019-09-08 13:09:20,979 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 13:09:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25359 states. [2019-09-08 13:09:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25359 to 20267. [2019-09-08 13:09:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20267 states. [2019-09-08 13:09:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20267 states to 20267 states and 31399 transitions. [2019-09-08 13:09:22,073 INFO L78 Accepts]: Start accepts. Automaton has 20267 states and 31399 transitions. Word has length 318 [2019-09-08 13:09:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:22,073 INFO L475 AbstractCegarLoop]: Abstraction has 20267 states and 31399 transitions. [2019-09-08 13:09:22,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20267 states and 31399 transitions. [2019-09-08 13:09:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:09:22,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:22,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:22,106 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1078345510, now seen corresponding path program 1 times [2019-09-08 13:09:22,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:22,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:22,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:22,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:22,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:22,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:22,284 INFO L87 Difference]: Start difference. First operand 20267 states and 31399 transitions. Second operand 3 states. [2019-09-08 13:09:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:23,746 INFO L93 Difference]: Finished difference Result 59231 states and 91478 transitions. [2019-09-08 13:09:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:23,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:09:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:23,811 INFO L225 Difference]: With dead ends: 59231 [2019-09-08 13:09:23,811 INFO L226 Difference]: Without dead ends: 39767 [2019-09-08 13:09:23,845 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 13:09:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39767 states. [2019-09-08 13:09:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39767 to 20371. [2019-09-08 13:09:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20371 states. [2019-09-08 13:09:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20371 states to 20371 states and 31542 transitions. [2019-09-08 13:09:25,805 INFO L78 Accepts]: Start accepts. Automaton has 20371 states and 31542 transitions. Word has length 318 [2019-09-08 13:09:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:25,805 INFO L475 AbstractCegarLoop]: Abstraction has 20371 states and 31542 transitions. [2019-09-08 13:09:25,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 20371 states and 31542 transitions. [2019-09-08 13:09:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 13:09:25,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:25,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:25,828 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash -380172961, now seen corresponding path program 1 times [2019-09-08 13:09:25,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:25,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:25,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:25,972 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 13:09:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:25,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:25,974 INFO L87 Difference]: Start difference. First operand 20371 states and 31542 transitions. Second operand 3 states. [2019-09-08 13:09:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:27,310 INFO L93 Difference]: Finished difference Result 59363 states and 91644 transitions. [2019-09-08 13:09:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:27,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-08 13:09:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:27,362 INFO L225 Difference]: With dead ends: 59363 [2019-09-08 13:09:27,362 INFO L226 Difference]: Without dead ends: 39892 [2019-09-08 13:09:27,389 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 13:09:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39892 states. [2019-09-08 13:09:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39892 to 20496. [2019-09-08 13:09:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-09-08 13:09:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 31688 transitions. [2019-09-08 13:09:28,370 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 31688 transitions. Word has length 319 [2019-09-08 13:09:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:28,371 INFO L475 AbstractCegarLoop]: Abstraction has 20496 states and 31688 transitions. [2019-09-08 13:09:28,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 31688 transitions. [2019-09-08 13:09:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:09:28,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:28,386 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1072562062, now seen corresponding path program 1 times [2019-09-08 13:09:28,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:28,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:28,630 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 13:09:28,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:28,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:28,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:28,632 INFO L87 Difference]: Start difference. First operand 20496 states and 31688 transitions. Second operand 3 states. [2019-09-08 13:09:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:29,983 INFO L93 Difference]: Finished difference Result 49702 states and 77399 transitions. [2019-09-08 13:09:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:09:29,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:09:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:30,028 INFO L225 Difference]: With dead ends: 49702 [2019-09-08 13:09:30,028 INFO L226 Difference]: Without dead ends: 31406 [2019-09-08 13:09:30,065 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 13:09:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31406 states. [2019-09-08 13:09:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31406 to 27332. [2019-09-08 13:09:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27332 states. [2019-09-08 13:09:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27332 states to 27332 states and 42883 transitions. [2019-09-08 13:09:31,549 INFO L78 Accepts]: Start accepts. Automaton has 27332 states and 42883 transitions. Word has length 320 [2019-09-08 13:09:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:31,549 INFO L475 AbstractCegarLoop]: Abstraction has 27332 states and 42883 transitions. [2019-09-08 13:09:31,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:09:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27332 states and 42883 transitions. [2019-09-08 13:09:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:09:31,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:31,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:31,563 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash -835465447, now seen corresponding path program 1 times [2019-09-08 13:09:31,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:31,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:31,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:32,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:32,041 INFO L87 Difference]: Start difference. First operand 27332 states and 42883 transitions. Second operand 4 states. [2019-09-08 13:09:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:34,258 INFO L93 Difference]: Finished difference Result 56125 states and 87933 transitions. [2019-09-08 13:09:34,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:34,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 13:09:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:34,287 INFO L225 Difference]: With dead ends: 56125 [2019-09-08 13:09:34,287 INFO L226 Difference]: Without dead ends: 28320 [2019-09-08 13:09:34,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 13:09:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28320 states. [2019-09-08 13:09:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28320 to 28216. [2019-09-08 13:09:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28216 states. [2019-09-08 13:09:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28216 states to 28216 states and 44004 transitions. [2019-09-08 13:09:35,456 INFO L78 Accepts]: Start accepts. Automaton has 28216 states and 44004 transitions. Word has length 320 [2019-09-08 13:09:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:35,456 INFO L475 AbstractCegarLoop]: Abstraction has 28216 states and 44004 transitions. [2019-09-08 13:09:35,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 28216 states and 44004 transitions. [2019-09-08 13:09:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:09:35,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:35,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:35,472 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1341864004, now seen corresponding path program 1 times [2019-09-08 13:09:35,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:35,924 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 13:09:35,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:35,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:09:35,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:09:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:09:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:09:35,925 INFO L87 Difference]: Start difference. First operand 28216 states and 44004 transitions. Second operand 10 states. [2019-09-08 13:09:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:42,803 INFO L93 Difference]: Finished difference Result 100299 states and 158759 transitions. [2019-09-08 13:09:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:09:42,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2019-09-08 13:09:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:42,892 INFO L225 Difference]: With dead ends: 100299 [2019-09-08 13:09:42,892 INFO L226 Difference]: Without dead ends: 74887 [2019-09-08 13:09:42,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:09:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74887 states. [2019-09-08 13:09:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74887 to 50756. [2019-09-08 13:09:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50756 states. [2019-09-08 13:09:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50756 states to 50756 states and 79477 transitions. [2019-09-08 13:09:46,706 INFO L78 Accepts]: Start accepts. Automaton has 50756 states and 79477 transitions. Word has length 321 [2019-09-08 13:09:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:46,707 INFO L475 AbstractCegarLoop]: Abstraction has 50756 states and 79477 transitions. [2019-09-08 13:09:46,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:09:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 50756 states and 79477 transitions. [2019-09-08 13:09:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:09:46,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:46,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:46,728 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1635752524, now seen corresponding path program 1 times [2019-09-08 13:09:46,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:46,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:46,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:46,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:47,236 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 13:09:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:47,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:47,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:47,238 INFO L87 Difference]: Start difference. First operand 50756 states and 79477 transitions. Second operand 4 states. [2019-09-08 13:09:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:52,442 INFO L93 Difference]: Finished difference Result 149408 states and 233865 transitions. [2019-09-08 13:09:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:52,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-08 13:09:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:52,561 INFO L225 Difference]: With dead ends: 149408 [2019-09-08 13:09:52,562 INFO L226 Difference]: Without dead ends: 98974 [2019-09-08 13:09:52,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98974 states. [2019-09-08 13:09:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98974 to 98877. [2019-09-08 13:09:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98877 states. [2019-09-08 13:09:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98877 states to 98877 states and 154115 transitions. [2019-09-08 13:09:59,472 INFO L78 Accepts]: Start accepts. Automaton has 98877 states and 154115 transitions. Word has length 321 [2019-09-08 13:09:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:59,473 INFO L475 AbstractCegarLoop]: Abstraction has 98877 states and 154115 transitions. [2019-09-08 13:09:59,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 98877 states and 154115 transitions. [2019-09-08 13:09:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:09:59,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:59,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:59,499 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 851278383, now seen corresponding path program 1 times [2019-09-08 13:09:59,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:59,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:59,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:59,821 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 13:09:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:59,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:59,823 INFO L87 Difference]: Start difference. First operand 98877 states and 154115 transitions. Second operand 4 states. [2019-09-08 13:10:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:12,244 INFO L93 Difference]: Finished difference Result 293977 states and 458123 transitions. [2019-09-08 13:10:12,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:12,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:10:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:12,529 INFO L225 Difference]: With dead ends: 293977 [2019-09-08 13:10:12,529 INFO L226 Difference]: Without dead ends: 197152 [2019-09-08 13:10:12,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:10:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197152 states. [2019-09-08 13:10:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197152 to 99906. [2019-09-08 13:10:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99906 states. [2019-09-08 13:10:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99906 states to 99906 states and 155839 transitions. [2019-09-08 13:10:22,530 INFO L78 Accepts]: Start accepts. Automaton has 99906 states and 155839 transitions. Word has length 322 [2019-09-08 13:10:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:22,531 INFO L475 AbstractCegarLoop]: Abstraction has 99906 states and 155839 transitions. [2019-09-08 13:10:22,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 99906 states and 155839 transitions. [2019-09-08 13:10:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:10:22,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:22,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:22,558 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1803740479, now seen corresponding path program 1 times [2019-09-08 13:10:22,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:22,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:22,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:22,790 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 13:10:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:22,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:22,792 INFO L87 Difference]: Start difference. First operand 99906 states and 155839 transitions. Second operand 3 states. [2019-09-08 13:10:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:34,786 INFO L93 Difference]: Finished difference Result 292550 states and 455601 transitions. [2019-09-08 13:10:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:34,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:10:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:35,056 INFO L225 Difference]: With dead ends: 292550 [2019-09-08 13:10:35,056 INFO L226 Difference]: Without dead ends: 194483 [2019-09-08 13:10:35,139 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 13:10:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194483 states. [2019-09-08 13:10:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194483 to 194390. [2019-09-08 13:10:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194390 states. [2019-09-08 13:10:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194390 states to 194390 states and 301412 transitions. [2019-09-08 13:10:51,355 INFO L78 Accepts]: Start accepts. Automaton has 194390 states and 301412 transitions. Word has length 322 [2019-09-08 13:10:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:51,356 INFO L475 AbstractCegarLoop]: Abstraction has 194390 states and 301412 transitions. [2019-09-08 13:10:51,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 194390 states and 301412 transitions. [2019-09-08 13:10:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 13:10:51,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:51,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:51,413 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1871689069, now seen corresponding path program 1 times [2019-09-08 13:10:51,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:51,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:51,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:51,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:51,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:51,675 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 13:10:51,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:51,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:51,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:51,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:51,678 INFO L87 Difference]: Start difference. First operand 194390 states and 301412 transitions. Second operand 3 states. [2019-09-08 13:11:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:19,244 INFO L93 Difference]: Finished difference Result 568108 states and 880371 transitions. [2019-09-08 13:11:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:11:19,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 13:11:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:19,800 INFO L225 Difference]: With dead ends: 568108 [2019-09-08 13:11:19,800 INFO L226 Difference]: Without dead ends: 378743 [2019-09-08 13:11:19,942 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 13:11:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378743 states. [2019-09-08 13:11:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378743 to 378647. [2019-09-08 13:11:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378647 states. [2019-09-08 13:11:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378647 states to 378647 states and 584753 transitions. [2019-09-08 13:11:54,966 INFO L78 Accepts]: Start accepts. Automaton has 378647 states and 584753 transitions. Word has length 323 [2019-09-08 13:11:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:54,966 INFO L475 AbstractCegarLoop]: Abstraction has 378647 states and 584753 transitions. [2019-09-08 13:11:54,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:11:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 378647 states and 584753 transitions. [2019-09-08 13:11:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:11:55,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:55,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:55,074 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:55,075 INFO L82 PathProgramCache]: Analyzing trace with hash -599969923, now seen corresponding path program 1 times [2019-09-08 13:11:55,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:55,471 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 13:11:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:55,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:55,474 INFO L87 Difference]: Start difference. First operand 378647 states and 584753 transitions. Second operand 4 states. [2019-09-08 13:12:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:59,797 INFO L93 Difference]: Finished difference Result 1120205 states and 1730570 transitions. [2019-09-08 13:12:59,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:59,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:12:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:00,924 INFO L225 Difference]: With dead ends: 1120205 [2019-09-08 13:13:00,924 INFO L226 Difference]: Without dead ends: 741960 [2019-09-08 13:13:01,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:13:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741960 states. [2019-09-08 13:14:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741960 to 741806. [2019-09-08 13:14:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741806 states. [2019-09-08 13:14:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741806 states to 741806 states and 1141715 transitions. [2019-09-08 13:14:14,681 INFO L78 Accepts]: Start accepts. Automaton has 741806 states and 1141715 transitions. Word has length 324 [2019-09-08 13:14:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:14,681 INFO L475 AbstractCegarLoop]: Abstraction has 741806 states and 1141715 transitions. [2019-09-08 13:14:14,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 741806 states and 1141715 transitions. [2019-09-08 13:14:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:14:14,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:14,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:14,915 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1416406792, now seen corresponding path program 1 times [2019-09-08 13:14:14,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:14,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:15,130 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 13:14:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:15,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:15,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:15,132 INFO L87 Difference]: Start difference. First operand 741806 states and 1141715 transitions. Second operand 3 states. [2019-09-08 13:16:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:30,887 INFO L93 Difference]: Finished difference Result 2193536 states and 3375135 transitions. [2019-09-08 13:16:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:30,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:16:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:33,234 INFO L225 Difference]: With dead ends: 2193536 [2019-09-08 13:16:33,234 INFO L226 Difference]: Without dead ends: 1455566 [2019-09-08 13:16:33,765 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 13:16:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455566 states.