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/product-lines/elevator_spec1_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:49:40,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:49:40,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:49:40,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:49:40,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:49:40,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:49:40,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:49:40,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:49:40,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:49:40,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:49:40,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:49:40,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:49:40,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:49:40,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:49:40,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:49:40,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:49:40,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:49:40,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:49:40,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:49:40,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:49:40,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:49:40,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:49:40,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:49:40,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:49:40,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:49:40,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:49:40,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:49:40,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:49:40,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:49:40,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:49:40,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:49:40,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:49:40,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:49:40,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:49:40,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:49:40,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:49:40,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:49:40,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:49:40,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:49:40,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:49:40,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:49:40,206 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 03:49:40,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:49:40,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:49:40,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:49:40,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:49:40,236 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:49:40,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:49:40,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:49:40,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:49:40,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:49:40,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:49:40,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:49:40,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:49:40,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:49:40,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:49:40,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:49:40,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:49:40,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:49:40,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:49:40,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:49:40,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:49:40,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:49:40,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:49:40,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:49:40,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:49:40,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:49:40,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:49:40,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:49:40,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:49:40,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:49:40,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:49:40,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:49:40,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:49:40,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:49:40,328 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:49:40,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product18.cil.c [2019-09-08 03:49:40,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedabc32e/f8b1987ed0414de590015b2aa723ceb8/FLAG3df524c84 [2019-09-08 03:49:41,071 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:49:41,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product18.cil.c [2019-09-08 03:49:41,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedabc32e/f8b1987ed0414de590015b2aa723ceb8/FLAG3df524c84 [2019-09-08 03:49:41,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fedabc32e/f8b1987ed0414de590015b2aa723ceb8 [2019-09-08 03:49:41,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:49:41,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:49:41,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:49:41,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:49:41,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:49:41,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:49:41" (1/1) ... [2019-09-08 03:49:41,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772df1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:41, skipping insertion in model container [2019-09-08 03:49:41,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:49:41" (1/1) ... [2019-09-08 03:49:41,237 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:49:41,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:49:42,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:49:42,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:49:42,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:49:42,291 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:49:42,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42 WrapperNode [2019-09-08 03:49:42,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:49:42,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:49:42,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:49:42,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:49:42,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (1/1) ... [2019-09-08 03:49:42,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:49:42,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:49:42,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:49:42,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:49:42,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (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 03:49:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:49:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:49:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:49:42,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:49:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:49:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:49:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:49:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:49:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:49:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:49:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:49:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:49:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:49:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:49:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:49:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:49:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:49:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:49:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:49:42,565 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:49:42,566 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:49:42,566 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:49:42,566 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:49:42,566 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:49:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:49:42,568 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:49:42,568 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:49:42,568 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:49:42,568 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:49:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:49:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:49:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:49:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-09-08 03:49:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:49:42,570 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:49:42,571 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:49:42,572 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:49:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:49:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:49:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:49:42,573 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:49:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:49:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:49:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:49:42,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:49:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:49:42,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:49:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:49:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:49:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:49:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:49:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:49:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:49:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:49:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:49:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:49:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:49:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:49:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:49:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:49:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:49:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:49:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:49:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:49:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:49:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:49:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:49:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:49:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:49:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:49:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:49:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:49:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:49:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:49:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:49:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:49:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:49:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:49:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:49:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:49:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:49:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:49:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:49:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:49:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:49:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:49:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:49:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:49:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:49:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:49:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-09-08 03:49:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-09-08 03:49:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:49:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:49:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:49:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:49:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:49:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:49:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:49:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:49:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:49:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:49:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:49:42,609 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:49:42,609 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:49:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:49:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:49:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:49:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:49:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:49:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:49:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:49:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:49:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:49:45,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:49:45,183 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:49:45,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:49:45 BoogieIcfgContainer [2019-09-08 03:49:45,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:49:45,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:49:45,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:49:45,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:49:45,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:49:41" (1/3) ... [2019-09-08 03:49:45,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4ef580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:49:45, skipping insertion in model container [2019-09-08 03:49:45,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:42" (2/3) ... [2019-09-08 03:49:45,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4ef580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:49:45, skipping insertion in model container [2019-09-08 03:49:45,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:49:45" (3/3) ... [2019-09-08 03:49:45,193 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product18.cil.c [2019-09-08 03:49:45,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:49:45,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:49:45,231 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:49:45,271 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:49:45,271 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:49:45,272 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:49:45,272 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:49:45,272 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:49:45,272 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:49:45,272 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:49:45,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:49:45,272 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:49:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states. [2019-09-08 03:49:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 03:49:45,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:45,338 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:45,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash 126544023, now seen corresponding path program 1 times [2019-09-08 03:49:45,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:45,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:49:46,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:46,019 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) [2019-09-08 03:49:46,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:46,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:49:46,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:49:46,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:46,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:49:46,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:49:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:49:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:49:46,898 INFO L87 Difference]: Start difference. First operand 759 states. Second operand 4 states. [2019-09-08 03:49:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:47,106 INFO L93 Difference]: Finished difference Result 1188 states and 1931 transitions. [2019-09-08 03:49:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:49:47,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 03:49:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:47,134 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 03:49:47,134 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 03:49:47,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:49:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 03:49:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-08 03:49:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 03:49:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-09-08 03:49:47,291 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 116 [2019-09-08 03:49:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:47,292 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-09-08 03:49:47,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:49:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-09-08 03:49:47,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:49:47,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:47,301 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:47,301 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:47,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1248298604, now seen corresponding path program 1 times [2019-09-08 03:49:47,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:47,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:49:47,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:47,563 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) [2019-09-08 03:49:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:48,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:48,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:49:48,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:48,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:48,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:48,109 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 6 states. [2019-09-08 03:49:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:48,224 INFO L93 Difference]: Finished difference Result 1168 states and 1891 transitions. [2019-09-08 03:49:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:49:48,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-08 03:49:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:48,231 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 03:49:48,231 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 03:49:48,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:49:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 03:49:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-08 03:49:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 03:49:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-09-08 03:49:48,284 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 120 [2019-09-08 03:49:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:48,285 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-09-08 03:49:48,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-09-08 03:49:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 03:49:48,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:48,288 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:48,289 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1488778386, now seen corresponding path program 1 times [2019-09-08 03:49:48,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:48,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:48,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:48,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:49:48,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:48,464 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 03:49:48,478 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 03:49:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:48,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 3177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:48,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:49:49,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:49,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:49,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:49,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:49,030 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 6 states. [2019-09-08 03:49:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:49,131 INFO L93 Difference]: Finished difference Result 1172 states and 1894 transitions. [2019-09-08 03:49:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:49:49,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-08 03:49:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:49,136 INFO L225 Difference]: With dead ends: 1172 [2019-09-08 03:49:49,137 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 03:49:49,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:49:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 03:49:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-08 03:49:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:49:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 963 transitions. [2019-09-08 03:49:49,168 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 963 transitions. Word has length 122 [2019-09-08 03:49:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:49,168 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 963 transitions. [2019-09-08 03:49:49,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 963 transitions. [2019-09-08 03:49:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:49:49,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:49,171 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:49,172 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1725323163, now seen corresponding path program 1 times [2019-09-08 03:49:49,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:49,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:49,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:49:49,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:49,287 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) [2019-09-08 03:49:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:49,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:49:49,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:49,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:49,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:49,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:49,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:49,864 INFO L87 Difference]: Start difference. First operand 604 states and 963 transitions. Second operand 6 states. [2019-09-08 03:49:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:49,993 INFO L93 Difference]: Finished difference Result 1171 states and 1885 transitions. [2019-09-08 03:49:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:49:49,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-09-08 03:49:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:50,003 INFO L225 Difference]: With dead ends: 1171 [2019-09-08 03:49:50,003 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 03:49:50,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 03:49:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-08 03:49:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:49:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 962 transitions. [2019-09-08 03:49:50,039 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 962 transitions. Word has length 123 [2019-09-08 03:49:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:50,040 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 962 transitions. [2019-09-08 03:49:50,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 962 transitions. [2019-09-08 03:49:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:49:50,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:50,047 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:50,047 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1073190474, now seen corresponding path program 1 times [2019-09-08 03:49:50,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:50,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:50,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:49:50,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:50,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:50,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:50,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:49:50,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:50,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:50,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:50,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:50,685 INFO L87 Difference]: Start difference. First operand 604 states and 962 transitions. Second operand 6 states. [2019-09-08 03:49:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:50,864 INFO L93 Difference]: Finished difference Result 1171 states and 1884 transitions. [2019-09-08 03:49:50,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:49:50,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-08 03:49:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:50,883 INFO L225 Difference]: With dead ends: 1171 [2019-09-08 03:49:50,883 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 03:49:50,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 03:49:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-08 03:49:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:49:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 961 transitions. [2019-09-08 03:49:50,937 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 961 transitions. Word has length 124 [2019-09-08 03:49:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:50,938 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 961 transitions. [2019-09-08 03:49:50,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 961 transitions. [2019-09-08 03:49:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:49:50,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:50,946 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:50,947 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash 825732863, now seen corresponding path program 1 times [2019-09-08 03:49:50,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:50,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:49:51,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:51,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:49:51,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:51,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:49:51,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:51,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:49:51,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:49:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:49:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:49:51,700 INFO L87 Difference]: Start difference. First operand 604 states and 961 transitions. Second operand 12 states. [2019-09-08 03:49:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:52,273 INFO L93 Difference]: Finished difference Result 1182 states and 1904 transitions. [2019-09-08 03:49:52,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:49:52,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-09-08 03:49:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:52,279 INFO L225 Difference]: With dead ends: 1182 [2019-09-08 03:49:52,279 INFO L226 Difference]: Without dead ends: 613 [2019-09-08 03:49:52,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:49:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-08 03:49:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-09-08 03:49:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:49:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 966 transitions. [2019-09-08 03:49:52,360 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 966 transitions. Word has length 125 [2019-09-08 03:49:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:52,362 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 966 transitions. [2019-09-08 03:49:52,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:49:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 966 transitions. [2019-09-08 03:49:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 03:49:52,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:52,365 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:52,366 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1751869533, now seen corresponding path program 1 times [2019-09-08 03:49:52,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:52,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:52,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:49:52,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:52,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:52,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:52,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 03:49:53,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:49:53,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:49:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:49:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:53,018 INFO L87 Difference]: Start difference. First operand 611 states and 966 transitions. Second operand 8 states. [2019-09-08 03:49:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:53,279 INFO L93 Difference]: Finished difference Result 1183 states and 1894 transitions. [2019-09-08 03:49:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:49:53,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-09-08 03:49:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:53,285 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 03:49:53,286 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:49:53,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:49:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:49:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:49:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:49:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-09-08 03:49:53,312 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 128 [2019-09-08 03:49:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:53,313 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-09-08 03:49:53,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:49:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-09-08 03:49:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:49:53,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:53,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:53,316 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1027560074, now seen corresponding path program 1 times [2019-09-08 03:49:53,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:53,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:49:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:53,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:53,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:53,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:49:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:53,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:53,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:53,998 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 6 states. [2019-09-08 03:49:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:54,323 INFO L93 Difference]: Finished difference Result 1219 states and 1940 transitions. [2019-09-08 03:49:54,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:49:54,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-08 03:49:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:54,328 INFO L225 Difference]: With dead ends: 1219 [2019-09-08 03:49:54,329 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 03:49:54,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 03:49:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2019-09-08 03:49:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-08 03:49:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1003 transitions. [2019-09-08 03:49:54,355 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1003 transitions. Word has length 129 [2019-09-08 03:49:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:54,355 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 1003 transitions. [2019-09-08 03:49:54,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1003 transitions. [2019-09-08 03:49:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 03:49:54,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:54,360 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:54,360 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash 44217569, now seen corresponding path program 1 times [2019-09-08 03:49:54,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:54,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:54,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:54,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:49:54,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:54,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:54,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:54,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:49:54,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:49:55,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:55,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:49:55,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:49:55,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:49:55,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:49:55,101 INFO L87 Difference]: Start difference. First operand 637 states and 1003 transitions. Second operand 14 states. [2019-09-08 03:49:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:55,475 INFO L93 Difference]: Finished difference Result 1220 states and 1942 transitions. [2019-09-08 03:49:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:49:55,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-08 03:49:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:55,481 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 03:49:55,482 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 03:49:55,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:49:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 03:49:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 626. [2019-09-08 03:49:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:49:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 983 transitions. [2019-09-08 03:49:55,506 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 983 transitions. Word has length 130 [2019-09-08 03:49:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:55,507 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 983 transitions. [2019-09-08 03:49:55,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:49:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 983 transitions. [2019-09-08 03:49:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 03:49:55,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:55,510 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:55,510 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2014728389, now seen corresponding path program 1 times [2019-09-08 03:49:55,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:55,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:49:55,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:55,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:49:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:56,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:56,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:49:56,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:56,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:49:56,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:49:56,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:49:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:56,169 INFO L87 Difference]: Start difference. First operand 626 states and 983 transitions. Second operand 8 states. [2019-09-08 03:49:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:56,446 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2019-09-08 03:49:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:49:56,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-09-08 03:49:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:56,452 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 03:49:56,452 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:49:56,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:49:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:49:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:49:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:49:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 967 transitions. [2019-09-08 03:49:56,478 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 967 transitions. Word has length 133 [2019-09-08 03:49:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:56,478 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 967 transitions. [2019-09-08 03:49:56,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:49:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 967 transitions. [2019-09-08 03:49:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 03:49:56,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:56,482 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:56,482 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1916978383, now seen corresponding path program 1 times [2019-09-08 03:49:56,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:56,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:49:56,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:56,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:49:56,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:57,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:57,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:49:57,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:49:57,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:49:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:49:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:57,123 INFO L87 Difference]: Start difference. First operand 626 states and 967 transitions. Second operand 8 states. [2019-09-08 03:49:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:57,390 INFO L93 Difference]: Finished difference Result 1202 states and 1880 transitions. [2019-09-08 03:49:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:49:57,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-09-08 03:49:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:57,399 INFO L225 Difference]: With dead ends: 1202 [2019-09-08 03:49:57,400 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:49:57,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:49:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:49:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:49:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:49:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 966 transitions. [2019-09-08 03:49:57,437 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 966 transitions. Word has length 134 [2019-09-08 03:49:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:57,438 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 966 transitions. [2019-09-08 03:49:57,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:49:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 966 transitions. [2019-09-08 03:49:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:49:57,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:57,442 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:57,443 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash 432742176, now seen corresponding path program 1 times [2019-09-08 03:49:57,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:57,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:57,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:49:57,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:57,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:49:57,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:58,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:49:58,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:49:58,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:49:58,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:49:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:49:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:49:58,277 INFO L87 Difference]: Start difference. First operand 626 states and 966 transitions. Second operand 18 states. [2019-09-08 03:49:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:58,855 INFO L93 Difference]: Finished difference Result 1218 states and 1907 transitions. [2019-09-08 03:49:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:49:58,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-09-08 03:49:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:58,860 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 03:49:58,861 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 03:49:58,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:49:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 03:49:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 637. [2019-09-08 03:49:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-08 03:49:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 974 transitions. [2019-09-08 03:49:58,885 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 974 transitions. Word has length 135 [2019-09-08 03:49:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:58,885 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 974 transitions. [2019-09-08 03:49:58,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:49:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 974 transitions. [2019-09-08 03:49:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:49:58,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:58,888 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:58,889 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash -960341789, now seen corresponding path program 1 times [2019-09-08 03:49:58,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:49:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:49:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:49:59,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:49:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:49:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:49:59,038 INFO L87 Difference]: Start difference. First operand 637 states and 974 transitions. Second operand 9 states. [2019-09-08 03:49:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:59,212 INFO L93 Difference]: Finished difference Result 1134 states and 1783 transitions. [2019-09-08 03:49:59,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:49:59,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 03:49:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:59,217 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 03:49:59,218 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 03:49:59,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:49:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 03:49:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-09-08 03:49:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 03:49:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 965 transitions. [2019-09-08 03:49:59,249 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 965 transitions. Word has length 136 [2019-09-08 03:49:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:59,251 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 965 transitions. [2019-09-08 03:49:59,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:49:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 965 transitions. [2019-09-08 03:49:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:49:59,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:59,254 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:49:59,254 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1349987427, now seen corresponding path program 1 times [2019-09-08 03:49:59,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:59,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:49:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:49:59,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:49:59,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:49:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:49:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:49:59,401 INFO L87 Difference]: Start difference. First operand 631 states and 965 transitions. Second operand 7 states. [2019-09-08 03:49:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:59,487 INFO L93 Difference]: Finished difference Result 1128 states and 1774 transitions. [2019-09-08 03:49:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:49:59,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-09-08 03:49:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:59,493 INFO L225 Difference]: With dead ends: 1128 [2019-09-08 03:49:59,494 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 03:49:59,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 03:49:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2019-09-08 03:49:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 03:49:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 923 transitions. [2019-09-08 03:49:59,528 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 923 transitions. Word has length 136 [2019-09-08 03:49:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:59,528 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 923 transitions. [2019-09-08 03:49:59,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:49:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 923 transitions. [2019-09-08 03:49:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:49:59,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:59,533 INFO L399 BasicCegarLoop]: trace histogram [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 03:49:59,534 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash -736732594, now seen corresponding path program 1 times [2019-09-08 03:49:59,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:59,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:59,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:49:59,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:49:59,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:49:59,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:49:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:49:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:49:59,775 INFO L87 Difference]: Start difference. First operand 599 states and 923 transitions. Second operand 13 states. [2019-09-08 03:50:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:00,141 INFO L93 Difference]: Finished difference Result 1165 states and 1822 transitions. [2019-09-08 03:50:00,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:50:00,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-09-08 03:50:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:00,150 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 03:50:00,150 INFO L226 Difference]: Without dead ends: 613 [2019-09-08 03:50:00,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:50:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-08 03:50:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-09-08 03:50:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:50:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 938 transitions. [2019-09-08 03:50:00,179 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 938 transitions. Word has length 138 [2019-09-08 03:50:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:00,180 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 938 transitions. [2019-09-08 03:50:00,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:50:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 938 transitions. [2019-09-08 03:50:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:50:00,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:00,182 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:50:00,183 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash 723351207, now seen corresponding path program 1 times [2019-09-08 03:50:00,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:00,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:00,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:00,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:50:00,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:00,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:50:00,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:50:00,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:50:00,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:50:00,424 INFO L87 Difference]: Start difference. First operand 611 states and 938 transitions. Second operand 13 states. [2019-09-08 03:50:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:00,729 INFO L93 Difference]: Finished difference Result 1109 states and 1745 transitions. [2019-09-08 03:50:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:50:00,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-09-08 03:50:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:00,734 INFO L225 Difference]: With dead ends: 1109 [2019-09-08 03:50:00,735 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 03:50:00,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:50:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 03:50:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-08 03:50:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:50:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 929 transitions. [2019-09-08 03:50:00,756 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 929 transitions. Word has length 137 [2019-09-08 03:50:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:00,756 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 929 transitions. [2019-09-08 03:50:00,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:50:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 929 transitions. [2019-09-08 03:50:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:50:00,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:00,759 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:50:00,759 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1206513036, now seen corresponding path program 1 times [2019-09-08 03:50:00,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:00,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:50:00,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:00,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:00,932 INFO L87 Difference]: Start difference. First operand 604 states and 929 transitions. Second operand 11 states. [2019-09-08 03:50:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:01,226 INFO L93 Difference]: Finished difference Result 1102 states and 1736 transitions. [2019-09-08 03:50:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:50:01,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-08 03:50:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:01,231 INFO L225 Difference]: With dead ends: 1102 [2019-09-08 03:50:01,231 INFO L226 Difference]: Without dead ends: 604 [2019-09-08 03:50:01,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:50:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-09-08 03:50:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-09-08 03:50:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:50:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 928 transitions. [2019-09-08 03:50:01,256 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 928 transitions. Word has length 139 [2019-09-08 03:50:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:01,257 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 928 transitions. [2019-09-08 03:50:01,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:50:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 928 transitions. [2019-09-08 03:50:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:50:01,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:01,261 INFO L399 BasicCegarLoop]: trace histogram [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 03:50:01,261 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash -267824249, now seen corresponding path program 1 times [2019-09-08 03:50:01,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:50:01,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:01,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:01,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:01,476 INFO L87 Difference]: Start difference. First operand 604 states and 928 transitions. Second operand 11 states. [2019-09-08 03:50:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:01,726 INFO L93 Difference]: Finished difference Result 1151 states and 1793 transitions. [2019-09-08 03:50:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:50:01,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-09-08 03:50:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:01,732 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 03:50:01,732 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 03:50:01,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:50:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 03:50:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 03:50:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 03:50:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 920 transitions. [2019-09-08 03:50:01,753 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 920 transitions. Word has length 140 [2019-09-08 03:50:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:01,754 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 920 transitions. [2019-09-08 03:50:01,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:50:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 920 transitions. [2019-09-08 03:50:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:50:01,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:01,757 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:50:01,757 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash -349409017, now seen corresponding path program 1 times [2019-09-08 03:50:01,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:01,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:50:01,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:01,935 INFO L87 Difference]: Start difference. First operand 601 states and 920 transitions. Second operand 6 states. [2019-09-08 03:50:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:05,406 INFO L93 Difference]: Finished difference Result 1689 states and 2708 transitions. [2019-09-08 03:50:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:50:05,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:50:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:05,417 INFO L225 Difference]: With dead ends: 1689 [2019-09-08 03:50:05,417 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 03:50:05,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 03:50:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1084. [2019-09-08 03:50:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2019-09-08 03:50:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1723 transitions. [2019-09-08 03:50:05,477 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1723 transitions. Word has length 141 [2019-09-08 03:50:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:05,479 INFO L475 AbstractCegarLoop]: Abstraction has 1084 states and 1723 transitions. [2019-09-08 03:50:05,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1723 transitions. [2019-09-08 03:50:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 03:50:05,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:05,485 INFO L399 BasicCegarLoop]: trace histogram [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, 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 03:50:05,485 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1135802722, now seen corresponding path program 1 times [2019-09-08 03:50:05,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:05,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:05,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:05,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:05,724 INFO L87 Difference]: Start difference. First operand 1084 states and 1723 transitions. Second operand 9 states. [2019-09-08 03:50:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:09,066 INFO L93 Difference]: Finished difference Result 2068 states and 3382 transitions. [2019-09-08 03:50:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:09,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2019-09-08 03:50:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:09,075 INFO L225 Difference]: With dead ends: 2068 [2019-09-08 03:50:09,075 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 03:50:09,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:50:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 03:50:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1092. [2019-09-08 03:50:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-09-08 03:50:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1761 transitions. [2019-09-08 03:50:09,134 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1761 transitions. Word has length 174 [2019-09-08 03:50:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:09,135 INFO L475 AbstractCegarLoop]: Abstraction has 1092 states and 1761 transitions. [2019-09-08 03:50:09,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1761 transitions. [2019-09-08 03:50:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 03:50:09,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:09,140 INFO L399 BasicCegarLoop]: trace histogram [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, 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 03:50:09,141 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash -130205023, now seen corresponding path program 1 times [2019-09-08 03:50:09,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:09,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:09,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:50:09,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:50:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:50:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:50:09,369 INFO L87 Difference]: Start difference. First operand 1092 states and 1761 transitions. Second operand 12 states. [2019-09-08 03:50:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:18,967 INFO L93 Difference]: Finished difference Result 3416 states and 5611 transitions. [2019-09-08 03:50:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:50:18,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 174 [2019-09-08 03:50:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:18,983 INFO L225 Difference]: With dead ends: 3416 [2019-09-08 03:50:18,983 INFO L226 Difference]: Without dead ends: 2436 [2019-09-08 03:50:18,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:50:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2019-09-08 03:50:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2374. [2019-09-08 03:50:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-09-08 03:50:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3834 transitions. [2019-09-08 03:50:19,104 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3834 transitions. Word has length 174 [2019-09-08 03:50:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:19,105 INFO L475 AbstractCegarLoop]: Abstraction has 2374 states and 3834 transitions. [2019-09-08 03:50:19,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:50:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3834 transitions. [2019-09-08 03:50:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:50:19,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:19,110 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 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 03:50:19,110 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1041883162, now seen corresponding path program 1 times [2019-09-08 03:50:19,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:19,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:19,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:50:19,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:19,279 INFO L87 Difference]: Start difference. First operand 2374 states and 3834 transitions. Second operand 8 states. [2019-09-08 03:50:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:26,342 INFO L93 Difference]: Finished difference Result 7929 states and 13285 transitions. [2019-09-08 03:50:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:50:26,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-09-08 03:50:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:26,377 INFO L225 Difference]: With dead ends: 7929 [2019-09-08 03:50:26,378 INFO L226 Difference]: Without dead ends: 5667 [2019-09-08 03:50:26,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:50:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5667 states. [2019-09-08 03:50:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5667 to 5619. [2019-09-08 03:50:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2019-09-08 03:50:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 9002 transitions. [2019-09-08 03:50:26,682 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 9002 transitions. Word has length 175 [2019-09-08 03:50:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:26,682 INFO L475 AbstractCegarLoop]: Abstraction has 5619 states and 9002 transitions. [2019-09-08 03:50:26,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 9002 transitions. [2019-09-08 03:50:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:50:26,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:26,694 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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 03:50:26,694 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -803869656, now seen corresponding path program 1 times [2019-09-08 03:50:26,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:26,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:26,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:26,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:26,914 INFO L87 Difference]: Start difference. First operand 5619 states and 9002 transitions. Second operand 9 states. [2019-09-08 03:50:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:34,626 INFO L93 Difference]: Finished difference Result 14760 states and 24280 transitions. [2019-09-08 03:50:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:50:34,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-08 03:50:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:34,698 INFO L225 Difference]: With dead ends: 14760 [2019-09-08 03:50:34,698 INFO L226 Difference]: Without dead ends: 9247 [2019-09-08 03:50:34,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:50:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9247 states. [2019-09-08 03:50:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9247 to 8637. [2019-09-08 03:50:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8637 states. [2019-09-08 03:50:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 13780 transitions. [2019-09-08 03:50:35,314 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 13780 transitions. Word has length 181 [2019-09-08 03:50:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:35,315 INFO L475 AbstractCegarLoop]: Abstraction has 8637 states and 13780 transitions. [2019-09-08 03:50:35,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 13780 transitions. [2019-09-08 03:50:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:50:35,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:35,319 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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 03:50:35,319 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash 329320937, now seen corresponding path program 1 times [2019-09-08 03:50:35,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:35,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:35,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:35,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:35,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:35,513 INFO L87 Difference]: Start difference. First operand 8637 states and 13780 transitions. Second operand 7 states. [2019-09-08 03:50:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:40,650 INFO L93 Difference]: Finished difference Result 24888 states and 41026 transitions. [2019-09-08 03:50:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:50:40,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-09-08 03:50:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:40,782 INFO L225 Difference]: With dead ends: 24888 [2019-09-08 03:50:40,782 INFO L226 Difference]: Without dead ends: 17535 [2019-09-08 03:50:40,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:50:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17535 states. [2019-09-08 03:50:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17535 to 17153. [2019-09-08 03:50:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17153 states. [2019-09-08 03:50:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17153 states to 17153 states and 27773 transitions. [2019-09-08 03:50:41,980 INFO L78 Accepts]: Start accepts. Automaton has 17153 states and 27773 transitions. Word has length 181 [2019-09-08 03:50:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:41,981 INFO L475 AbstractCegarLoop]: Abstraction has 17153 states and 27773 transitions. [2019-09-08 03:50:41,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 17153 states and 27773 transitions. [2019-09-08 03:50:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:50:41,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:41,985 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:50:41,986 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash 822286010, now seen corresponding path program 1 times [2019-09-08 03:50:41,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:41,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:41,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:42,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:42,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:50:42,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:50:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:50:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:50:42,135 INFO L87 Difference]: Start difference. First operand 17153 states and 27773 transitions. Second operand 5 states. [2019-09-08 03:50:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:42,627 INFO L93 Difference]: Finished difference Result 33262 states and 54462 transitions. [2019-09-08 03:50:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:50:42,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-09-08 03:50:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:42,735 INFO L225 Difference]: With dead ends: 33262 [2019-09-08 03:50:42,735 INFO L226 Difference]: Without dead ends: 17558 [2019-09-08 03:50:42,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:50:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17558 states. [2019-09-08 03:50:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17558 to 17342. [2019-09-08 03:50:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17342 states. [2019-09-08 03:50:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17342 states to 17342 states and 28037 transitions. [2019-09-08 03:50:44,692 INFO L78 Accepts]: Start accepts. Automaton has 17342 states and 28037 transitions. Word has length 186 [2019-09-08 03:50:44,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:44,693 INFO L475 AbstractCegarLoop]: Abstraction has 17342 states and 28037 transitions. [2019-09-08 03:50:44,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:50:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 17342 states and 28037 transitions. [2019-09-08 03:50:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:50:44,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:44,698 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:50:44,698 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:44,699 INFO L82 PathProgramCache]: Analyzing trace with hash 842371117, now seen corresponding path program 1 times [2019-09-08 03:50:44,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:44,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:44,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:50:44,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:44,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:44,845 INFO L87 Difference]: Start difference. First operand 17342 states and 28037 transitions. Second operand 7 states. [2019-09-08 03:50:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:45,518 INFO L93 Difference]: Finished difference Result 35428 states and 58860 transitions. [2019-09-08 03:50:45,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:50:45,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-08 03:50:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:45,624 INFO L225 Difference]: With dead ends: 35428 [2019-09-08 03:50:45,624 INFO L226 Difference]: Without dead ends: 17342 [2019-09-08 03:50:45,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17342 states. [2019-09-08 03:50:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17342 to 17342. [2019-09-08 03:50:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17342 states. [2019-09-08 03:50:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17342 states to 17342 states and 27647 transitions. [2019-09-08 03:50:46,621 INFO L78 Accepts]: Start accepts. Automaton has 17342 states and 27647 transitions. Word has length 193 [2019-09-08 03:50:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:46,622 INFO L475 AbstractCegarLoop]: Abstraction has 17342 states and 27647 transitions. [2019-09-08 03:50:46,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17342 states and 27647 transitions. [2019-09-08 03:50:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 03:50:46,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:46,632 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:50:46,632 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:46,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1995568651, now seen corresponding path program 1 times [2019-09-08 03:50:46,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:46,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:46,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:50:46,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:46,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:46,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:46,795 INFO L87 Difference]: Start difference. First operand 17342 states and 27647 transitions. Second operand 7 states. [2019-09-08 03:50:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:51,567 INFO L93 Difference]: Finished difference Result 34816 states and 56088 transitions. [2019-09-08 03:50:51,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:50:51,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-09-08 03:50:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:51,645 INFO L225 Difference]: With dead ends: 34816 [2019-09-08 03:50:51,645 INFO L226 Difference]: Without dead ends: 18945 [2019-09-08 03:50:51,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:50:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18945 states. [2019-09-08 03:50:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18945 to 18404. [2019-09-08 03:50:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18404 states. [2019-09-08 03:50:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18404 states to 18404 states and 29087 transitions. [2019-09-08 03:50:52,420 INFO L78 Accepts]: Start accepts. Automaton has 18404 states and 29087 transitions. Word has length 198 [2019-09-08 03:50:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:52,421 INFO L475 AbstractCegarLoop]: Abstraction has 18404 states and 29087 transitions. [2019-09-08 03:50:52,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18404 states and 29087 transitions. [2019-09-08 03:50:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 03:50:52,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:52,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:50:52,427 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1351986423, now seen corresponding path program 1 times [2019-09-08 03:50:52,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:52,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:50:52,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:52,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:52,642 INFO L87 Difference]: Start difference. First operand 18404 states and 29087 transitions. Second operand 11 states. [2019-09-08 03:51:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:00,274 INFO L93 Difference]: Finished difference Result 41564 states and 66356 transitions. [2019-09-08 03:51:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:51:00,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 205 [2019-09-08 03:51:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:00,358 INFO L225 Difference]: With dead ends: 41564 [2019-09-08 03:51:00,358 INFO L226 Difference]: Without dead ends: 24414 [2019-09-08 03:51:00,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:51:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24414 states. [2019-09-08 03:51:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24414 to 23692. [2019-09-08 03:51:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23692 states. [2019-09-08 03:51:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23692 states to 23692 states and 36797 transitions. [2019-09-08 03:51:01,250 INFO L78 Accepts]: Start accepts. Automaton has 23692 states and 36797 transitions. Word has length 205 [2019-09-08 03:51:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:01,250 INFO L475 AbstractCegarLoop]: Abstraction has 23692 states and 36797 transitions. [2019-09-08 03:51:01,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:51:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23692 states and 36797 transitions. [2019-09-08 03:51:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 03:51:01,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:01,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:01,257 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1155346926, now seen corresponding path program 1 times [2019-09-08 03:51:01,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:01,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:51:01,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:01,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:01,401 INFO L87 Difference]: Start difference. First operand 23692 states and 36797 transitions. Second operand 6 states. [2019-09-08 03:51:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:02,869 INFO L93 Difference]: Finished difference Result 57126 states and 90193 transitions. [2019-09-08 03:51:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:51:02,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-08 03:51:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:02,999 INFO L225 Difference]: With dead ends: 57126 [2019-09-08 03:51:02,999 INFO L226 Difference]: Without dead ends: 34905 [2019-09-08 03:51:03,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34905 states. [2019-09-08 03:51:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34905 to 29431. [2019-09-08 03:51:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29431 states. [2019-09-08 03:51:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29431 states to 29431 states and 46320 transitions. [2019-09-08 03:51:04,029 INFO L78 Accepts]: Start accepts. Automaton has 29431 states and 46320 transitions. Word has length 203 [2019-09-08 03:51:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:04,030 INFO L475 AbstractCegarLoop]: Abstraction has 29431 states and 46320 transitions. [2019-09-08 03:51:04,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29431 states and 46320 transitions. [2019-09-08 03:51:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 03:51:04,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:04,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:04,035 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1227733484, now seen corresponding path program 1 times [2019-09-08 03:51:04,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:51:04,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:04,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:51:04,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:51:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:51:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:51:04,182 INFO L87 Difference]: Start difference. First operand 29431 states and 46320 transitions. Second operand 4 states. [2019-09-08 03:51:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:05,841 INFO L93 Difference]: Finished difference Result 58398 states and 93194 transitions. [2019-09-08 03:51:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:51:05,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-08 03:51:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:05,958 INFO L225 Difference]: With dead ends: 58398 [2019-09-08 03:51:05,958 INFO L226 Difference]: Without dead ends: 29079 [2019-09-08 03:51:06,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:51:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29079 states. [2019-09-08 03:51:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29079 to 29079. [2019-09-08 03:51:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29079 states. [2019-09-08 03:51:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29079 states to 29079 states and 45616 transitions. [2019-09-08 03:51:07,344 INFO L78 Accepts]: Start accepts. Automaton has 29079 states and 45616 transitions. Word has length 203 [2019-09-08 03:51:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:07,344 INFO L475 AbstractCegarLoop]: Abstraction has 29079 states and 45616 transitions. [2019-09-08 03:51:07,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:51:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29079 states and 45616 transitions. [2019-09-08 03:51:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 03:51:07,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:07,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:07,349 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 594672537, now seen corresponding path program 1 times [2019-09-08 03:51:07,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:51:07,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:07,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:07,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:07,524 INFO L87 Difference]: Start difference. First operand 29079 states and 45616 transitions. Second operand 6 states. [2019-09-08 03:51:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:08,719 INFO L93 Difference]: Finished difference Result 29168 states and 45782 transitions. [2019-09-08 03:51:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:51:08,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-09-08 03:51:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:08,823 INFO L225 Difference]: With dead ends: 29168 [2019-09-08 03:51:08,823 INFO L226 Difference]: Without dead ends: 29152 [2019-09-08 03:51:08,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29152 states. [2019-09-08 03:51:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29152 to 29094. [2019-09-08 03:51:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2019-09-08 03:51:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 45631 transitions. [2019-09-08 03:51:11,251 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 45631 transitions. Word has length 204 [2019-09-08 03:51:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:11,251 INFO L475 AbstractCegarLoop]: Abstraction has 29094 states and 45631 transitions. [2019-09-08 03:51:11,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 45631 transitions. [2019-09-08 03:51:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 03:51:11,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:11,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:11,255 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash 583948890, now seen corresponding path program 1 times [2019-09-08 03:51:11,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:11,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:51:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:51:11,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:51:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:51:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:51:11,419 INFO L87 Difference]: Start difference. First operand 29094 states and 45631 transitions. Second operand 9 states. [2019-09-08 03:51:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:12,797 INFO L93 Difference]: Finished difference Result 30830 states and 48222 transitions. [2019-09-08 03:51:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:51:12,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2019-09-08 03:51:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:12,931 INFO L225 Difference]: With dead ends: 30830 [2019-09-08 03:51:12,931 INFO L226 Difference]: Without dead ends: 30726 [2019-09-08 03:51:12,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:51:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30726 states. [2019-09-08 03:51:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30726 to 30258. [2019-09-08 03:51:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30258 states. [2019-09-08 03:51:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30258 states to 30258 states and 47386 transitions. [2019-09-08 03:51:14,243 INFO L78 Accepts]: Start accepts. Automaton has 30258 states and 47386 transitions. Word has length 212 [2019-09-08 03:51:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:14,244 INFO L475 AbstractCegarLoop]: Abstraction has 30258 states and 47386 transitions. [2019-09-08 03:51:14,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:51:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 30258 states and 47386 transitions. [2019-09-08 03:51:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:51:14,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:14,250 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:14,250 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2007386448, now seen corresponding path program 1 times [2019-09-08 03:51:14,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:14,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:51:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:51:14,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:51:14,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:51:14,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:51:14,447 INFO L87 Difference]: Start difference. First operand 30258 states and 47386 transitions. Second operand 9 states. [2019-09-08 03:51:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:19,486 INFO L93 Difference]: Finished difference Result 60574 states and 95458 transitions. [2019-09-08 03:51:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:51:19,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 228 [2019-09-08 03:51:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:19,608 INFO L225 Difference]: With dead ends: 60574 [2019-09-08 03:51:19,609 INFO L226 Difference]: Without dead ends: 30448 [2019-09-08 03:51:19,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:51:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-09-08 03:51:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 30258. [2019-09-08 03:51:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30258 states. [2019-09-08 03:51:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30258 states to 30258 states and 47311 transitions. [2019-09-08 03:51:20,726 INFO L78 Accepts]: Start accepts. Automaton has 30258 states and 47311 transitions. Word has length 228 [2019-09-08 03:51:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:20,727 INFO L475 AbstractCegarLoop]: Abstraction has 30258 states and 47311 transitions. [2019-09-08 03:51:20,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:51:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30258 states and 47311 transitions. [2019-09-08 03:51:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 03:51:20,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:20,733 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:20,733 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 311603223, now seen corresponding path program 1 times [2019-09-08 03:51:20,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 03:51:20,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:20,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:21,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 3668 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:51:21,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:21,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:51:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:51:22,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:22,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 03:51:22,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:51:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:51:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:51:22,072 INFO L87 Difference]: Start difference. First operand 30258 states and 47311 transitions. Second operand 16 states. [2019-09-08 03:51:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:32,058 INFO L93 Difference]: Finished difference Result 63203 states and 99091 transitions. [2019-09-08 03:51:32,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:51:32,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 237 [2019-09-08 03:51:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:32,200 INFO L225 Difference]: With dead ends: 63203 [2019-09-08 03:51:32,200 INFO L226 Difference]: Without dead ends: 34493 [2019-09-08 03:51:32,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:51:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34493 states. [2019-09-08 03:51:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34493 to 33714. [2019-09-08 03:51:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33714 states. [2019-09-08 03:51:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33714 states to 33714 states and 51925 transitions. [2019-09-08 03:51:33,466 INFO L78 Accepts]: Start accepts. Automaton has 33714 states and 51925 transitions. Word has length 237 [2019-09-08 03:51:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:33,467 INFO L475 AbstractCegarLoop]: Abstraction has 33714 states and 51925 transitions. [2019-09-08 03:51:33,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:51:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33714 states and 51925 transitions. [2019-09-08 03:51:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 03:51:33,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:33,473 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:33,473 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1045381337, now seen corresponding path program 1 times [2019-09-08 03:51:33,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:33,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:33,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:33,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 03:51:33,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:33,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:33,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:34,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 3766 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 03:51:34,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 03:51:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:51:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:51:34,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:51:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:51:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:51:34,820 INFO L87 Difference]: Start difference. First operand 33714 states and 51925 transitions. Second operand 19 states. [2019-09-08 03:51:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:47,731 INFO L93 Difference]: Finished difference Result 103827 states and 162015 transitions. [2019-09-08 03:51:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:51:47,731 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 267 [2019-09-08 03:51:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:48,121 INFO L225 Difference]: With dead ends: 103827 [2019-09-08 03:51:48,122 INFO L226 Difference]: Without dead ends: 70237 [2019-09-08 03:51:48,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:51:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70237 states. [2019-09-08 03:51:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70237 to 69409. [2019-09-08 03:51:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69409 states. [2019-09-08 03:51:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69409 states to 69409 states and 107816 transitions. [2019-09-08 03:51:51,283 INFO L78 Accepts]: Start accepts. Automaton has 69409 states and 107816 transitions. Word has length 267 [2019-09-08 03:51:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:51,284 INFO L475 AbstractCegarLoop]: Abstraction has 69409 states and 107816 transitions. [2019-09-08 03:51:51,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:51:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 69409 states and 107816 transitions. [2019-09-08 03:51:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 03:51:51,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:51,292 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:51,292 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:51,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash 944621351, now seen corresponding path program 1 times [2019-09-08 03:51:51,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:51,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:51,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 03:51:53,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:53,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:53,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:54,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 3767 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:54,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:51:54,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:54,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:51:54,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:54,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:54,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:54,442 INFO L87 Difference]: Start difference. First operand 69409 states and 107816 transitions. Second operand 6 states. [2019-09-08 03:51:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:57,323 INFO L93 Difference]: Finished difference Result 141558 states and 224458 transitions. [2019-09-08 03:51:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:51:57,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-08 03:51:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:57,616 INFO L225 Difference]: With dead ends: 141558 [2019-09-08 03:51:57,617 INFO L226 Difference]: Without dead ends: 70349 [2019-09-08 03:51:57,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70349 states. [2019-09-08 03:52:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70349 to 70247. [2019-09-08 03:52:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70247 states. [2019-09-08 03:52:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70247 states to 70247 states and 106805 transitions. [2019-09-08 03:52:01,035 INFO L78 Accepts]: Start accepts. Automaton has 70247 states and 106805 transitions. Word has length 268 [2019-09-08 03:52:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:01,035 INFO L475 AbstractCegarLoop]: Abstraction has 70247 states and 106805 transitions. [2019-09-08 03:52:01,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:52:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70247 states and 106805 transitions. [2019-09-08 03:52:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 03:52:01,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:01,045 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 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, 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, 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] [2019-09-08 03:52:01,045 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1086169043, now seen corresponding path program 1 times [2019-09-08 03:52:01,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:01,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-09-08 03:52:01,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:01,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:01,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 4970 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:52:01,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 03:52:02,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:02,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:52:02,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:52:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:52:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:02,064 INFO L87 Difference]: Start difference. First operand 70247 states and 106805 transitions. Second operand 7 states. [2019-09-08 03:52:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:06,823 INFO L93 Difference]: Finished difference Result 142472 states and 219751 transitions. [2019-09-08 03:52:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:52:06,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 388 [2019-09-08 03:52:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:07,180 INFO L225 Difference]: With dead ends: 142472 [2019-09-08 03:52:07,180 INFO L226 Difference]: Without dead ends: 72341 [2019-09-08 03:52:07,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72341 states. [2019-09-08 03:52:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72341 to 72341. [2019-09-08 03:52:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72341 states. [2019-09-08 03:52:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72341 states to 72341 states and 110357 transitions. [2019-09-08 03:52:13,730 INFO L78 Accepts]: Start accepts. Automaton has 72341 states and 110357 transitions. Word has length 388 [2019-09-08 03:52:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:13,730 INFO L475 AbstractCegarLoop]: Abstraction has 72341 states and 110357 transitions. [2019-09-08 03:52:13,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:52:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 72341 states and 110357 transitions. [2019-09-08 03:52:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-08 03:52:13,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:13,747 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 4, 4, 3, 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, 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, 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, 1, 1, 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 03:52:13,748 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2068812864, now seen corresponding path program 1 times [2019-09-08 03:52:13,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-08 03:52:14,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:14,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:14,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:14,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 5090 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:52:14,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-09-08 03:52:15,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:52:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:52:15,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:52:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:52:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:52:15,108 INFO L87 Difference]: Start difference. First operand 72341 states and 110357 transitions. Second operand 15 states. [2019-09-08 03:52:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:35,402 INFO L93 Difference]: Finished difference Result 254803 states and 407007 transitions. [2019-09-08 03:52:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:52:35,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 423 [2019-09-08 03:52:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:36,499 INFO L225 Difference]: With dead ends: 254803 [2019-09-08 03:52:36,500 INFO L226 Difference]: Without dead ends: 182133 [2019-09-08 03:52:36,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:52:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182133 states. [2019-09-08 03:52:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182133 to 175548. [2019-09-08 03:52:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175548 states. [2019-09-08 03:52:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175548 states to 175548 states and 267152 transitions. [2019-09-08 03:52:49,762 INFO L78 Accepts]: Start accepts. Automaton has 175548 states and 267152 transitions. Word has length 423 [2019-09-08 03:52:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:49,763 INFO L475 AbstractCegarLoop]: Abstraction has 175548 states and 267152 transitions. [2019-09-08 03:52:49,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:52:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 175548 states and 267152 transitions. [2019-09-08 03:52:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 03:52:49,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:49,772 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 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, 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, 1, 1, 1, 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 03:52:49,772 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 747418218, now seen corresponding path program 1 times [2019-09-08 03:52:49,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:49,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:49,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:49,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:49,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-08 03:52:49,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:49,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:52:49,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:52:49,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:52:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:49,981 INFO L87 Difference]: Start difference. First operand 175548 states and 267152 transitions. Second operand 8 states. [2019-09-08 03:53:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:01,240 INFO L93 Difference]: Finished difference Result 338604 states and 522580 transitions. [2019-09-08 03:53:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:53:01,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 317 [2019-09-08 03:53:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:02,031 INFO L225 Difference]: With dead ends: 338604 [2019-09-08 03:53:02,032 INFO L226 Difference]: Without dead ends: 163248 [2019-09-08 03:53:02,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:53:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163248 states. [2019-09-08 03:53:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163248 to 163200. [2019-09-08 03:53:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163200 states. [2019-09-08 03:53:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163200 states to 163200 states and 248548 transitions. [2019-09-08 03:53:16,838 INFO L78 Accepts]: Start accepts. Automaton has 163200 states and 248548 transitions. Word has length 317 [2019-09-08 03:53:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:16,839 INFO L475 AbstractCegarLoop]: Abstraction has 163200 states and 248548 transitions. [2019-09-08 03:53:16,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:53:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 163200 states and 248548 transitions. [2019-09-08 03:53:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 03:53:16,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:16,845 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:53:16,846 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 921712730, now seen corresponding path program 1 times [2019-09-08 03:53:16,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 03:53:17,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:17,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:17,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 4351 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:53:17,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:53:17,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:53:17,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:53:17,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:53:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:53:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:53:17,863 INFO L87 Difference]: Start difference. First operand 163200 states and 248548 transitions. Second operand 13 states. [2019-09-08 03:53:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:42,783 INFO L93 Difference]: Finished difference Result 352138 states and 547617 transitions. [2019-09-08 03:53:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:53:42,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 327 [2019-09-08 03:53:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:43,623 INFO L225 Difference]: With dead ends: 352138 [2019-09-08 03:53:43,623 INFO L226 Difference]: Without dead ends: 189110 [2019-09-08 03:53:43,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:53:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189110 states. [2019-09-08 03:53:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189110 to 187452. [2019-09-08 03:53:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187452 states. [2019-09-08 03:54:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187452 states to 187452 states and 286590 transitions. [2019-09-08 03:54:00,947 INFO L78 Accepts]: Start accepts. Automaton has 187452 states and 286590 transitions. Word has length 327 [2019-09-08 03:54:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:00,947 INFO L475 AbstractCegarLoop]: Abstraction has 187452 states and 286590 transitions. [2019-09-08 03:54:00,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:54:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 187452 states and 286590 transitions. [2019-09-08 03:54:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 03:54:00,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:00,955 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:00,955 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash -381457501, now seen corresponding path program 1 times [2019-09-08 03:54:00,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:00,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:00,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 03:54:01,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:01,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:01,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:01,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 4354 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:54:01,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 03:54:01,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:54:01,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:54:01,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:54:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:54:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:54:01,918 INFO L87 Difference]: Start difference. First operand 187452 states and 286590 transitions. Second operand 12 states. [2019-09-08 03:54:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:32,647 INFO L93 Difference]: Finished difference Result 548353 states and 900363 transitions. [2019-09-08 03:54:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:54:32,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 330 [2019-09-08 03:54:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:34,338 INFO L225 Difference]: With dead ends: 548353 [2019-09-08 03:54:34,338 INFO L226 Difference]: Without dead ends: 351725 [2019-09-08 03:54:34,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:54:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351725 states. [2019-09-08 03:55:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351725 to 341037. [2019-09-08 03:55:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341037 states. [2019-09-08 03:55:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341037 states to 341037 states and 523959 transitions. [2019-09-08 03:55:07,532 INFO L78 Accepts]: Start accepts. Automaton has 341037 states and 523959 transitions. Word has length 330 [2019-09-08 03:55:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:07,533 INFO L475 AbstractCegarLoop]: Abstraction has 341037 states and 523959 transitions. [2019-09-08 03:55:07,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:55:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 341037 states and 523959 transitions. [2019-09-08 03:55:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 03:55:07,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:07,546 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:07,546 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:07,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -797329420, now seen corresponding path program 1 times [2019-09-08 03:55:07,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-08 03:55:08,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:08,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:08,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:09,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 4334 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:55:09,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 03:55:09,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:09,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:55:09,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:55:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:55:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:55:09,368 INFO L87 Difference]: Start difference. First operand 341037 states and 523959 transitions. Second operand 12 states. [2019-09-08 03:56:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:04,428 INFO L93 Difference]: Finished difference Result 983388 states and 1624238 transitions. [2019-09-08 03:56:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:56:04,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 331 [2019-09-08 03:56:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:08,417 INFO L225 Difference]: With dead ends: 983388 [2019-09-08 03:56:08,417 INFO L226 Difference]: Without dead ends: 625775 [2019-09-08 03:56:09,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 03:56:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625775 states. [2019-09-08 03:57:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625775 to 617985. [2019-09-08 03:57:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617985 states. [2019-09-08 03:57:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617985 states to 617985 states and 952041 transitions. [2019-09-08 03:57:15,643 INFO L78 Accepts]: Start accepts. Automaton has 617985 states and 952041 transitions. Word has length 331 [2019-09-08 03:57:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:15,644 INFO L475 AbstractCegarLoop]: Abstraction has 617985 states and 952041 transitions. [2019-09-08 03:57:15,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:57:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 617985 states and 952041 transitions. [2019-09-08 03:57:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 03:57:15,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:15,670 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:57:15,670 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash -61324452, now seen corresponding path program 1 times [2019-09-08 03:57:15,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:15,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 03:57:15,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:57:15,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:57:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:57:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:16,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 4388 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 03:57:16,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:57:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 39 proven. 55 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 03:57:16,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:57:16,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 03:57:16,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:57:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:57:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:57:16,809 INFO L87 Difference]: Start difference. First operand 617985 states and 952041 transitions. Second operand 19 states. [2019-09-08 03:59:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:24,239 INFO L93 Difference]: Finished difference Result 1983091 states and 3430531 transitions. [2019-09-08 03:59:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 03:59:24,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 339 [2019-09-08 03:59:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:59:36,127 INFO L225 Difference]: With dead ends: 1983091 [2019-09-08 03:59:36,127 INFO L226 Difference]: Without dead ends: 1325342