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/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:02:43,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:02:43,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:02:43,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:02:43,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:02:43,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:02:43,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:02:43,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:02:43,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:02:43,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:02:43,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:02:43,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:02:43,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:02:43,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:02:43,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:02:43,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:02:43,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:02:43,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:02:43,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:02:43,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:02:43,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:02:43,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:02:43,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:02:43,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:02:43,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:02:43,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:02:43,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:02:43,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:02:43,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:02:43,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:02:43,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:02:43,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:02:43,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:02:43,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:02:43,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:02:43,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:02:43,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:02:43,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:02:43,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:02:43,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:02:43,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:02:43,564 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 08:02:43,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:02:43,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:02:43,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:02:43,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:02:43,587 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:02:43,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:02:43,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:02:43,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:02:43,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:02:43,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:02:43,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:02:43,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:02:43,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:02:43,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:02:43,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:02:43,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:02:43,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:02:43,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:02:43,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:02:43,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:02:43,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:02:43,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:02:43,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:02:43,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:02:43,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:02:43,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:02:43,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:02:43,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:02:43,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:02:43,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:02:43,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:02:43,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:02:43,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:02:43,666 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:02:43,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:02:43,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c645ed23/8b04082c7b3d45e69d77b361a7a40f99/FLAG0341a46ce [2019-09-08 08:02:44,188 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:02:44,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:02:44,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c645ed23/8b04082c7b3d45e69d77b361a7a40f99/FLAG0341a46ce [2019-09-08 08:02:44,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c645ed23/8b04082c7b3d45e69d77b361a7a40f99 [2019-09-08 08:02:44,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:02:44,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:02:44,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:02:44,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:02:44,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:02:44,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:02:44" (1/1) ... [2019-09-08 08:02:44,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a39f893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:44, skipping insertion in model container [2019-09-08 08:02:44,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:02:44" (1/1) ... [2019-09-08 08:02:44,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:02:44,632 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:02:44,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:02:44,998 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:02:45,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:02:45,115 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:02:45,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45 WrapperNode [2019-09-08 08:02:45,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:02:45,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:02:45,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:02:45,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:02:45,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (1/1) ... [2019-09-08 08:02:45,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:02:45,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:02:45,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:02:45,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:02:45,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (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 08:02:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:02:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:02:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:02:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:02:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:02:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:02:45,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:02:45,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:02:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:02:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:02:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:02:45,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:02:45,261 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 08:02:45,262 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:02:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:02:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:02:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:02:45,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:02:46,129 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:02:46,129 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:02:46,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:02:46 BoogieIcfgContainer [2019-09-08 08:02:46,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:02:46,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:02:46,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:02:46,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:02:46,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:02:44" (1/3) ... [2019-09-08 08:02:46,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88bb1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:02:46, skipping insertion in model container [2019-09-08 08:02:46,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:02:45" (2/3) ... [2019-09-08 08:02:46,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88bb1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:02:46, skipping insertion in model container [2019-09-08 08:02:46,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:02:46" (3/3) ... [2019-09-08 08:02:46,142 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:02:46,152 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:02:46,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:02:46,180 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:02:46,222 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:02:46,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:02:46,222 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:02:46,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:02:46,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:02:46,223 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:02:46,223 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:02:46,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:02:46,223 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:02:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2019-09-08 08:02:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 08:02:46,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:02:46,255 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] [2019-09-08 08:02:46,257 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:02:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:02:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash -413245806, now seen corresponding path program 1 times [2019-09-08 08:02:46,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:02:46,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:02:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:46,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:02:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:46,744 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 08:02:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:02:46,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:02:46,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:02:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:02:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:02:46,774 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 5 states. [2019-09-08 08:02:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:02:46,960 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-09-08 08:02:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:02:46,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 08:02:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:02:46,974 INFO L225 Difference]: With dead ends: 265 [2019-09-08 08:02:46,975 INFO L226 Difference]: Without dead ends: 159 [2019-09-08 08:02:46,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:02:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-08 08:02:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-08 08:02:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 08:02:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2019-09-08 08:02:47,032 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 75 [2019-09-08 08:02:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:02:47,033 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2019-09-08 08:02:47,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:02:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2019-09-08 08:02:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 08:02:47,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:02:47,039 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] [2019-09-08 08:02:47,039 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:02:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:02:47,040 INFO L82 PathProgramCache]: Analyzing trace with hash -350916994, now seen corresponding path program 1 times [2019-09-08 08:02:47,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:02:47,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:02:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:47,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:02:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:47,604 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 08:02:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:02:47,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 08:02:47,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 08:02:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 08:02:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-08 08:02:47,609 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand 17 states. [2019-09-08 08:03:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:00,921 INFO L93 Difference]: Finished difference Result 2126 states and 3358 transitions. [2019-09-08 08:03:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 08:03:00,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-09-08 08:03:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:00,972 INFO L225 Difference]: With dead ends: 2126 [2019-09-08 08:03:00,973 INFO L226 Difference]: Without dead ends: 2029 [2019-09-08 08:03:00,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1998, Invalid=7122, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 08:03:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-09-08 08:03:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1049. [2019-09-08 08:03:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-09-08 08:03:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1497 transitions. [2019-09-08 08:03:01,209 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1497 transitions. Word has length 124 [2019-09-08 08:03:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:01,215 INFO L475 AbstractCegarLoop]: Abstraction has 1049 states and 1497 transitions. [2019-09-08 08:03:01,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 08:03:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1497 transitions. [2019-09-08 08:03:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:01,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:01,231 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] [2019-09-08 08:03:01,231 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1555525682, now seen corresponding path program 1 times [2019-09-08 08:03:01,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:01,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:01,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:01,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:01,352 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 08:03:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:03:01,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:03:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:03:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:03:01,354 INFO L87 Difference]: Start difference. First operand 1049 states and 1497 transitions. Second operand 3 states. [2019-09-08 08:03:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:01,456 INFO L93 Difference]: Finished difference Result 2961 states and 4296 transitions. [2019-09-08 08:03:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:03:01,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 08:03:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:01,468 INFO L225 Difference]: With dead ends: 2961 [2019-09-08 08:03:01,469 INFO L226 Difference]: Without dead ends: 1974 [2019-09-08 08:03:01,473 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 08:03:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-08 08:03:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1972. [2019-09-08 08:03:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2019-09-08 08:03:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2823 transitions. [2019-09-08 08:03:01,595 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2823 transitions. Word has length 126 [2019-09-08 08:03:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:01,596 INFO L475 AbstractCegarLoop]: Abstraction has 1972 states and 2823 transitions. [2019-09-08 08:03:01,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:03:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2823 transitions. [2019-09-08 08:03:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:01,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:01,600 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] [2019-09-08 08:03:01,601 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1451739158, now seen corresponding path program 1 times [2019-09-08 08:03:01,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:01,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:01,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:01,818 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 08:03:01,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:01,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:01,820 INFO L87 Difference]: Start difference. First operand 1972 states and 2823 transitions. Second operand 5 states. [2019-09-08 08:03:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:02,569 INFO L93 Difference]: Finished difference Result 5654 states and 8173 transitions. [2019-09-08 08:03:02,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:02,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 08:03:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:02,603 INFO L225 Difference]: With dead ends: 5654 [2019-09-08 08:03:02,604 INFO L226 Difference]: Without dead ends: 3744 [2019-09-08 08:03:02,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2019-09-08 08:03:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3742. [2019-09-08 08:03:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-09-08 08:03:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5357 transitions. [2019-09-08 08:03:02,989 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5357 transitions. Word has length 126 [2019-09-08 08:03:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 3742 states and 5357 transitions. [2019-09-08 08:03:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5357 transitions. [2019-09-08 08:03:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:02,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:02,999 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] [2019-09-08 08:03:02,999 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1647482868, now seen corresponding path program 1 times [2019-09-08 08:03:03,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:03,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:03,314 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 08:03:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:03,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:03,317 INFO L87 Difference]: Start difference. First operand 3742 states and 5357 transitions. Second operand 5 states. [2019-09-08 08:03:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:04,480 INFO L93 Difference]: Finished difference Result 10850 states and 15619 transitions. [2019-09-08 08:03:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:04,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 08:03:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:04,523 INFO L225 Difference]: With dead ends: 10850 [2019-09-08 08:03:04,523 INFO L226 Difference]: Without dead ends: 7170 [2019-09-08 08:03:04,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-09-08 08:03:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7168. [2019-09-08 08:03:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-09-08 08:03:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 10207 transitions. [2019-09-08 08:03:05,026 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 10207 transitions. Word has length 126 [2019-09-08 08:03:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:05,027 INFO L475 AbstractCegarLoop]: Abstraction has 7168 states and 10207 transitions. [2019-09-08 08:03:05,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 10207 transitions. [2019-09-08 08:03:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:05,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:05,030 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] [2019-09-08 08:03:05,030 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 556504150, now seen corresponding path program 1 times [2019-09-08 08:03:05,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:05,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:05,231 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 08:03:05,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:05,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:05,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:05,233 INFO L87 Difference]: Start difference. First operand 7168 states and 10207 transitions. Second operand 5 states. [2019-09-08 08:03:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:06,356 INFO L93 Difference]: Finished difference Result 20852 states and 29825 transitions. [2019-09-08 08:03:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:06,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 08:03:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:06,477 INFO L225 Difference]: With dead ends: 20852 [2019-09-08 08:03:06,477 INFO L226 Difference]: Without dead ends: 13746 [2019-09-08 08:03:06,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2019-09-08 08:03:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 13744. [2019-09-08 08:03:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13744 states. [2019-09-08 08:03:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 19455 transitions. [2019-09-08 08:03:07,490 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 19455 transitions. Word has length 126 [2019-09-08 08:03:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:07,492 INFO L475 AbstractCegarLoop]: Abstraction has 13744 states and 19455 transitions. [2019-09-08 08:03:07,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 19455 transitions. [2019-09-08 08:03:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:07,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:07,496 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] [2019-09-08 08:03:07,496 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -794671284, now seen corresponding path program 1 times [2019-09-08 08:03:07,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:07,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:07,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:07,646 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 08:03:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:07,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:07,648 INFO L87 Difference]: Start difference. First operand 13744 states and 19455 transitions. Second operand 5 states. [2019-09-08 08:03:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:09,741 INFO L93 Difference]: Finished difference Result 40052 states and 56897 transitions. [2019-09-08 08:03:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:09,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 08:03:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:09,856 INFO L225 Difference]: With dead ends: 40052 [2019-09-08 08:03:09,856 INFO L226 Difference]: Without dead ends: 26370 [2019-09-08 08:03:09,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26370 states. [2019-09-08 08:03:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26370 to 26368. [2019-09-08 08:03:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26368 states. [2019-09-08 08:03:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26368 states to 26368 states and 37071 transitions. [2019-09-08 08:03:11,254 INFO L78 Accepts]: Start accepts. Automaton has 26368 states and 37071 transitions. Word has length 126 [2019-09-08 08:03:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:11,254 INFO L475 AbstractCegarLoop]: Abstraction has 26368 states and 37071 transitions. [2019-09-08 08:03:11,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26368 states and 37071 transitions. [2019-09-08 08:03:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:11,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:11,257 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] [2019-09-08 08:03:11,258 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 452837570, now seen corresponding path program 1 times [2019-09-08 08:03:11,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:11,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:11,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:11,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:11,379 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 08:03:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:11,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:03:11,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:03:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:03:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:03:11,381 INFO L87 Difference]: Start difference. First operand 26368 states and 37071 transitions. Second operand 5 states. [2019-09-08 08:03:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:13,310 INFO L93 Difference]: Finished difference Result 76772 states and 108337 transitions. [2019-09-08 08:03:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:03:13,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 08:03:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:13,496 INFO L225 Difference]: With dead ends: 76772 [2019-09-08 08:03:13,497 INFO L226 Difference]: Without dead ends: 50466 [2019-09-08 08:03:13,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:03:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50466 states. [2019-09-08 08:03:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50466 to 50464. [2019-09-08 08:03:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50464 states. [2019-09-08 08:03:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50464 states to 50464 states and 70463 transitions. [2019-09-08 08:03:17,222 INFO L78 Accepts]: Start accepts. Automaton has 50464 states and 70463 transitions. Word has length 126 [2019-09-08 08:03:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:17,222 INFO L475 AbstractCegarLoop]: Abstraction has 50464 states and 70463 transitions. [2019-09-08 08:03:17,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:03:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50464 states and 70463 transitions. [2019-09-08 08:03:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:17,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:17,224 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] [2019-09-08 08:03:17,225 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1185390580, now seen corresponding path program 1 times [2019-09-08 08:03:17,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:17,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:17,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:17,619 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 08:03:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 08:03:17,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 08:03:17,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 08:03:17,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-08 08:03:17,621 INFO L87 Difference]: Start difference. First operand 50464 states and 70463 transitions. Second operand 17 states. [2019-09-08 08:03:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:36,538 INFO L93 Difference]: Finished difference Result 168798 states and 261198 transitions. [2019-09-08 08:03:36,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 08:03:36,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-08 08:03:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:37,179 INFO L225 Difference]: With dead ends: 168798 [2019-09-08 08:03:37,179 INFO L226 Difference]: Without dead ends: 118396 [2019-09-08 08:03:37,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2040, Invalid=7080, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 08:03:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118396 states. [2019-09-08 08:03:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118396 to 69728. [2019-09-08 08:03:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69728 states. [2019-09-08 08:03:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69728 states to 69728 states and 97631 transitions. [2019-09-08 08:03:43,653 INFO L78 Accepts]: Start accepts. Automaton has 69728 states and 97631 transitions. Word has length 126 [2019-09-08 08:03:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:43,653 INFO L475 AbstractCegarLoop]: Abstraction has 69728 states and 97631 transitions. [2019-09-08 08:03:43,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 08:03:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69728 states and 97631 transitions. [2019-09-08 08:03:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:43,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:43,656 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] [2019-09-08 08:03:43,656 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:43,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1595147712, now seen corresponding path program 1 times [2019-09-08 08:03:43,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:43,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:43,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:43,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:43,800 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 08:03:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:43,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:03:43,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:03:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:03:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:03:43,803 INFO L87 Difference]: Start difference. First operand 69728 states and 97631 transitions. Second operand 9 states. [2019-09-08 08:03:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:03:48,638 INFO L93 Difference]: Finished difference Result 167291 states and 231915 transitions. [2019-09-08 08:03:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:03:48,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-08 08:03:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:03:48,980 INFO L225 Difference]: With dead ends: 167291 [2019-09-08 08:03:48,980 INFO L226 Difference]: Without dead ends: 97625 [2019-09-08 08:03:49,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:03:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97625 states. [2019-09-08 08:03:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97625 to 69791. [2019-09-08 08:03:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69791 states. [2019-09-08 08:03:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69791 states to 69791 states and 97709 transitions. [2019-09-08 08:03:55,073 INFO L78 Accepts]: Start accepts. Automaton has 69791 states and 97709 transitions. Word has length 126 [2019-09-08 08:03:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:03:55,074 INFO L475 AbstractCegarLoop]: Abstraction has 69791 states and 97709 transitions. [2019-09-08 08:03:55,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:03:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69791 states and 97709 transitions. [2019-09-08 08:03:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 08:03:55,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:03:55,076 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] [2019-09-08 08:03:55,076 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:03:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:03:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash -310265592, now seen corresponding path program 1 times [2019-09-08 08:03:55,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:03:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:03:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:03:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:03:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:03:55,196 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 08:03:55,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:03:55,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:03:55,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:03:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:03:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:03:55,198 INFO L87 Difference]: Start difference. First operand 69791 states and 97709 transitions. Second operand 9 states. [2019-09-08 08:04:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:01,578 INFO L93 Difference]: Finished difference Result 164223 states and 229753 transitions. [2019-09-08 08:04:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:04:01,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-08 08:04:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:01,887 INFO L225 Difference]: With dead ends: 164223 [2019-09-08 08:04:01,887 INFO L226 Difference]: Without dead ends: 94503 [2019-09-08 08:04:02,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 08:04:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94503 states. [2019-09-08 08:04:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94503 to 84124. [2019-09-08 08:04:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84124 states. [2019-09-08 08:04:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84124 states to 84124 states and 118019 transitions. [2019-09-08 08:04:06,206 INFO L78 Accepts]: Start accepts. Automaton has 84124 states and 118019 transitions. Word has length 126 [2019-09-08 08:04:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:06,207 INFO L475 AbstractCegarLoop]: Abstraction has 84124 states and 118019 transitions. [2019-09-08 08:04:06,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:04:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 84124 states and 118019 transitions. [2019-09-08 08:04:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 08:04:06,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:06,211 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] [2019-09-08 08:04:06,212 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash -842811969, now seen corresponding path program 1 times [2019-09-08 08:04:06,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:06,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:06,341 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 08:04:06,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:06,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:04:06,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:04:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:04:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:04:06,343 INFO L87 Difference]: Start difference. First operand 84124 states and 118019 transitions. Second operand 5 states. [2019-09-08 08:04:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:13,388 INFO L93 Difference]: Finished difference Result 197783 states and 277825 transitions. [2019-09-08 08:04:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:04:13,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-08 08:04:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:13,784 INFO L225 Difference]: With dead ends: 197783 [2019-09-08 08:04:13,784 INFO L226 Difference]: Without dead ends: 113748 [2019-09-08 08:04:13,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:04:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113748 states. [2019-09-08 08:04:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113748 to 113742. [2019-09-08 08:04:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113742 states. [2019-09-08 08:04:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113742 states to 113742 states and 158907 transitions. [2019-09-08 08:04:19,323 INFO L78 Accepts]: Start accepts. Automaton has 113742 states and 158907 transitions. Word has length 127 [2019-09-08 08:04:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:19,323 INFO L475 AbstractCegarLoop]: Abstraction has 113742 states and 158907 transitions. [2019-09-08 08:04:19,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:04:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 113742 states and 158907 transitions. [2019-09-08 08:04:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 08:04:19,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:19,325 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] [2019-09-08 08:04:19,325 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash 804612992, now seen corresponding path program 1 times [2019-09-08 08:04:19,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:19,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:19,466 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 08:04:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:04:19,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:04:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:04:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:04:19,467 INFO L87 Difference]: Start difference. First operand 113742 states and 158907 transitions. Second operand 11 states. [2019-09-08 08:04:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:26,251 INFO L93 Difference]: Finished difference Result 130821 states and 192389 transitions. [2019-09-08 08:04:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 08:04:26,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-08 08:04:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:26,624 INFO L225 Difference]: With dead ends: 130821 [2019-09-08 08:04:26,624 INFO L226 Difference]: Without dead ends: 130819 [2019-09-08 08:04:26,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 08:04:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130819 states. [2019-09-08 08:04:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130819 to 120078. [2019-09-08 08:04:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120078 states. [2019-09-08 08:04:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120078 states to 120078 states and 165403 transitions. [2019-09-08 08:04:32,847 INFO L78 Accepts]: Start accepts. Automaton has 120078 states and 165403 transitions. Word has length 127 [2019-09-08 08:04:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:32,847 INFO L475 AbstractCegarLoop]: Abstraction has 120078 states and 165403 transitions. [2019-09-08 08:04:32,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:04:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 120078 states and 165403 transitions. [2019-09-08 08:04:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 08:04:32,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:32,849 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] [2019-09-08 08:04:32,849 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash -376867979, now seen corresponding path program 1 times [2019-09-08 08:04:32,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:32,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:32,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:32,970 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 08:04:32,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:04:32,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:04:32,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:04:32,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:04:32,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:04:32,972 INFO L87 Difference]: Start difference. First operand 120078 states and 165403 transitions. Second operand 5 states. [2019-09-08 08:04:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:45,324 INFO L93 Difference]: Finished difference Result 235877 states and 324336 transitions. [2019-09-08 08:04:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:04:45,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-08 08:04:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:45,658 INFO L225 Difference]: With dead ends: 235877 [2019-09-08 08:04:45,659 INFO L226 Difference]: Without dead ends: 147213 [2019-09-08 08:04:45,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:04:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147213 states. [2019-09-08 08:04:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147213 to 147208. [2019-09-08 08:04:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147208 states. [2019-09-08 08:04:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147208 states to 147208 states and 199150 transitions. [2019-09-08 08:04:53,712 INFO L78 Accepts]: Start accepts. Automaton has 147208 states and 199150 transitions. Word has length 127 [2019-09-08 08:04:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:04:53,712 INFO L475 AbstractCegarLoop]: Abstraction has 147208 states and 199150 transitions. [2019-09-08 08:04:53,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:04:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 147208 states and 199150 transitions. [2019-09-08 08:04:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 08:04:53,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:04:53,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:04:53,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:04:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:04:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1329221549, now seen corresponding path program 1 times [2019-09-08 08:04:53,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:04:53,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:04:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:53,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:04:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 08:04:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:04:53,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:04:53,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:04:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:04:54,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 08:04:54,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:04:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 08:04:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:04:54,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [5] total 18 [2019-09-08 08:04:54,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 08:04:54,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 08:04:54,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-08 08:04:54,581 INFO L87 Difference]: Start difference. First operand 147208 states and 199150 transitions. Second operand 18 states. [2019-09-08 08:05:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:05:08,624 INFO L93 Difference]: Finished difference Result 254198 states and 343380 transitions. [2019-09-08 08:05:08,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 08:05:08,625 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-08 08:05:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:05:09,198 INFO L225 Difference]: With dead ends: 254198 [2019-09-08 08:05:09,199 INFO L226 Difference]: Without dead ends: 107092 [2019-09-08 08:05:09,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=589, Invalid=1763, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 08:05:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107092 states. [2019-09-08 08:05:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107092 to 102256. [2019-09-08 08:05:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102256 states. [2019-09-08 08:05:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102256 states to 102256 states and 136632 transitions. [2019-09-08 08:05:18,131 INFO L78 Accepts]: Start accepts. Automaton has 102256 states and 136632 transitions. Word has length 192 [2019-09-08 08:05:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:05:18,132 INFO L475 AbstractCegarLoop]: Abstraction has 102256 states and 136632 transitions. [2019-09-08 08:05:18,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 08:05:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 102256 states and 136632 transitions. [2019-09-08 08:05:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 08:05:18,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:05:18,157 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:05:18,157 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:05:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:05:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1951540649, now seen corresponding path program 1 times [2019-09-08 08:05:18,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:05:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:05:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:18,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:05:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 08:05:18,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:05:18,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:05:18,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:05:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:05:18,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 08:05:18,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:05:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 08:05:19,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:05:19,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2019-09-08 08:05:19,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 08:05:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 08:05:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-09-08 08:05:19,644 INFO L87 Difference]: Start difference. First operand 102256 states and 136632 transitions. Second operand 24 states. [2019-09-08 08:05:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:05:45,249 INFO L93 Difference]: Finished difference Result 404913 states and 543564 transitions. [2019-09-08 08:05:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:05:45,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 192 [2019-09-08 08:05:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:05:46,223 INFO L225 Difference]: With dead ends: 404913 [2019-09-08 08:05:46,223 INFO L226 Difference]: Without dead ends: 302783 [2019-09-08 08:05:46,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=848, Invalid=2934, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 08:05:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302783 states. [2019-09-08 08:06:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302783 to 295617. [2019-09-08 08:06:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295617 states. [2019-09-08 08:06:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295617 states to 295617 states and 390732 transitions. [2019-09-08 08:06:10,696 INFO L78 Accepts]: Start accepts. Automaton has 295617 states and 390732 transitions. Word has length 192 [2019-09-08 08:06:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:06:10,697 INFO L475 AbstractCegarLoop]: Abstraction has 295617 states and 390732 transitions. [2019-09-08 08:06:10,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 08:06:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 295617 states and 390732 transitions. [2019-09-08 08:06:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 08:06:10,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:06:10,755 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:06:10,756 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:06:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:06:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 530030361, now seen corresponding path program 1 times [2019-09-08 08:06:10,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:06:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:06:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:06:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 08:06:11,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:06:11,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 08:06:11,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:06:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:11,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 08:06:11,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:06:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 08:06:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:06:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [21] total 37 [2019-09-08 08:06:12,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 08:06:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 08:06:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 08:06:12,356 INFO L87 Difference]: Start difference. First operand 295617 states and 390732 transitions. Second operand 37 states. [2019-09-08 08:08:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:08:07,162 INFO L93 Difference]: Finished difference Result 1171875 states and 1626445 transitions. [2019-09-08 08:08:07,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-08 08:08:07,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 192 [2019-09-08 08:08:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:08:10,014 INFO L225 Difference]: With dead ends: 1171875 [2019-09-08 08:08:10,014 INFO L226 Difference]: Without dead ends: 1055937 [2019-09-08 08:08:10,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 248 SyntacticMatches, 7 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13180 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5055, Invalid=27525, Unknown=0, NotChecked=0, Total=32580 [2019-09-08 08:08:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055937 states. [2019-09-08 08:09:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055937 to 580161. [2019-09-08 08:09:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580161 states. [2019-09-08 08:09:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580161 states to 580161 states and 764524 transitions. [2019-09-08 08:09:20,214 INFO L78 Accepts]: Start accepts. Automaton has 580161 states and 764524 transitions. Word has length 192 [2019-09-08 08:09:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:09:20,214 INFO L475 AbstractCegarLoop]: Abstraction has 580161 states and 764524 transitions. [2019-09-08 08:09:20,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 08:09:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 580161 states and 764524 transitions. [2019-09-08 08:09:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 08:09:20,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:09:20,277 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:20,278 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:09:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:09:20,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1297111993, now seen corresponding path program 1 times [2019-09-08 08:09:20,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:09:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:09:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:09:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 08:09:20,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:09:20,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:09:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:09:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:09:21,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 08:09:21,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:09:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 08:09:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:09:21,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 37 [2019-09-08 08:09:21,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 08:09:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 08:09:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 08:09:21,619 INFO L87 Difference]: Start difference. First operand 580161 states and 764524 transitions. Second operand 37 states. [2019-09-08 08:09:46,085 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34