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_spec14_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:43:13,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:43:13,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:43:13,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:43:13,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:43:13,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:43:13,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:43:13,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:43:13,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:43:13,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:43:13,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:43:13,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:43:13,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:43:13,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:43:13,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:43:13,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:43:13,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:43:13,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:43:13,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:43:13,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:43:13,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:43:13,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:43:13,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:43:13,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:43:13,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:43:13,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:43:13,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:43:13,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:43:13,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:43:13,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:43:13,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:43:13,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:43:13,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:43:13,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:43:13,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:43:13,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:43:13,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:43:13,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:43:13,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:43:13,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:43:13,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:43:13,215 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:43:13,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:43:13,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:43:13,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:43:13,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:43:13,243 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:43:13,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:43:13,244 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:43:13,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:43:13,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:43:13,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:43:13,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:43:13,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:43:13,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:43:13,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:43:13,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:43:13,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:43:13,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:43:13,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:43:13,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:43:13,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:43:13,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:43:13,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:43:13,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:43:13,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:43:13,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:43:13,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:43:13,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:43:13,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:43:13,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:43:13,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:43:13,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:43:13,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:43:13,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:43:13,299 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:43:13,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-09-08 03:43:13,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729b21c85/ef1ef025c7cf452ca8af359fa32ce8ea/FLAG934fb3ed4 [2019-09-08 03:43:13,964 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:43:13,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-09-08 03:43:13,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729b21c85/ef1ef025c7cf452ca8af359fa32ce8ea/FLAG934fb3ed4 [2019-09-08 03:43:14,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729b21c85/ef1ef025c7cf452ca8af359fa32ce8ea [2019-09-08 03:43:14,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:43:14,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:43:14,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:43:14,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:43:14,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:43:14,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:43:14" (1/1) ... [2019-09-08 03:43:14,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296f8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:14, skipping insertion in model container [2019-09-08 03:43:14,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:43:14" (1/1) ... [2019-09-08 03:43:14,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:43:14,232 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:43:14,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:43:14,968 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:43:15,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:43:15,179 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:43:15,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15 WrapperNode [2019-09-08 03:43:15,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:43:15,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:43:15,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:43:15,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:43:15,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (1/1) ... [2019-09-08 03:43:15,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:43:15,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:43:15,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:43:15,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:43:15,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (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:43:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:43:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:43:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:43:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:43:15,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:43:15,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:43:15,457 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:43:15,457 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:43:15,457 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:43:15,458 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:43:15,458 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:43:15,458 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:43:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:43:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:43:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:43:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:43:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:43:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:43:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:43:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:43:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:43:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:43:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:43:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:43:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:43:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:43:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:43:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:43:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:43:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:43:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:43:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:43:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:43:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:43:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:43:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:43:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:43:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:43:15,469 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:43:15,469 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:43:15,469 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:43:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:43:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:43:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:43:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:43:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:43:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:43:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:43:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:43:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:43:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:43:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:43:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:43:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:43:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:43:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:43:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:43:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:43:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:43:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:43:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:43:15,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:43:15,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:43:15,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:43:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:43:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:43:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 03:43:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:43:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 03:43:15,477 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:43:15,477 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:43:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:43:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:43:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:43:15,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:43:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:43:15,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:43:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:43:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:43:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:43:15,480 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:43:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:43:15,482 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:43:15,482 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:43:15,482 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:43:15,483 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:43:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:43:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:43:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:43:15,484 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:43:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:43:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:43:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:43:15,485 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:43:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:43:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:43:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:43:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:43:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:43:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:43:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:43:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:43:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:43:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:43:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:43:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:43:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:43:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:43:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:43:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:43:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:43:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:43:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:43:15,491 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:43:15,492 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:43:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:43:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:43:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:43:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:43:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:43:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:43:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:43:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:43:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:43:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:43:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:43:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:43:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:43:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:43:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:43:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:43:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:43:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:43:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:43:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:43:15,514 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:43:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:43:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:43:15,515 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:43:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:43:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:43:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:43:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:43:15,516 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:43:15,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:43:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:43:17,887 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:43:17,888 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:43:17,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:43:17 BoogieIcfgContainer [2019-09-08 03:43:17,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:43:17,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:43:17,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:43:17,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:43:17,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:43:14" (1/3) ... [2019-09-08 03:43:17,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2074b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:43:17, skipping insertion in model container [2019-09-08 03:43:17,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:43:15" (2/3) ... [2019-09-08 03:43:17,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2074b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:43:17, skipping insertion in model container [2019-09-08 03:43:17,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:43:17" (3/3) ... [2019-09-08 03:43:17,899 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2019-09-08 03:43:17,911 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:43:17,923 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:43:17,944 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:43:17,988 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:43:17,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:43:17,990 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:43:17,990 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:43:17,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:43:17,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:43:17,990 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:43:17,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:43:17,990 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:43:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states. [2019-09-08 03:43:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 03:43:18,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:18,054 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:18,058 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1156947632, now seen corresponding path program 1 times [2019-09-08 03:43:18,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:18,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:18,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:18,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:18,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:18,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:18,612 INFO L87 Difference]: Start difference. First operand 798 states. Second operand 4 states. [2019-09-08 03:43:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:18,820 INFO L93 Difference]: Finished difference Result 1280 states and 2032 transitions. [2019-09-08 03:43:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:18,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 03:43:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:18,856 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 03:43:18,856 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:43:18,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:43:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-08 03:43:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:43:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1007 transitions. [2019-09-08 03:43:19,027 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1007 transitions. Word has length 87 [2019-09-08 03:43:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:19,028 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1007 transitions. [2019-09-08 03:43:19,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1007 transitions. [2019-09-08 03:43:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 03:43:19,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:19,037 INFO L399 BasicCegarLoop]: trace histogram [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:43:19,037 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1296609552, now seen corresponding path program 1 times [2019-09-08 03:43:19,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:19,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:19,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:19,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:19,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:19,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:19,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:19,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:19,273 INFO L87 Difference]: Start difference. First operand 643 states and 1007 transitions. Second operand 4 states. [2019-09-08 03:43:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:19,364 INFO L93 Difference]: Finished difference Result 1253 states and 1975 transitions. [2019-09-08 03:43:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:19,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 03:43:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:19,372 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 03:43:19,372 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:43:19,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:43:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-08 03:43:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:43:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1006 transitions. [2019-09-08 03:43:19,449 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1006 transitions. Word has length 88 [2019-09-08 03:43:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:19,449 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1006 transitions. [2019-09-08 03:43:19,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1006 transitions. [2019-09-08 03:43:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 03:43:19,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:19,454 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:19,455 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1734809644, now seen corresponding path program 1 times [2019-09-08 03:43:19,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:19,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:19,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:19,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:19,631 INFO L87 Difference]: Start difference. First operand 643 states and 1006 transitions. Second operand 4 states. [2019-09-08 03:43:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:19,711 INFO L93 Difference]: Finished difference Result 1253 states and 1974 transitions. [2019-09-08 03:43:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:19,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 03:43:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:19,717 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 03:43:19,717 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:43:19,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:43:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-08 03:43:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:43:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1005 transitions. [2019-09-08 03:43:19,751 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1005 transitions. Word has length 89 [2019-09-08 03:43:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:19,751 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1005 transitions. [2019-09-08 03:43:19,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1005 transitions. [2019-09-08 03:43:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 03:43:19,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:19,753 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:19,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1457208820, now seen corresponding path program 1 times [2019-09-08 03:43:19,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:19,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:19,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:19,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:19,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:19,910 INFO L87 Difference]: Start difference. First operand 643 states and 1005 transitions. Second operand 4 states. [2019-09-08 03:43:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:19,997 INFO L93 Difference]: Finished difference Result 1253 states and 1973 transitions. [2019-09-08 03:43:19,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:19,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 03:43:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:20,010 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 03:43:20,010 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:43:20,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:43:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-08 03:43:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:43:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1004 transitions. [2019-09-08 03:43:20,058 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1004 transitions. Word has length 90 [2019-09-08 03:43:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:20,058 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1004 transitions. [2019-09-08 03:43:20,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1004 transitions. [2019-09-08 03:43:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 03:43:20,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:20,061 INFO L399 BasicCegarLoop]: trace histogram [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:43:20,062 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1221885528, now seen corresponding path program 1 times [2019-09-08 03:43:20,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:20,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:20,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:20,179 INFO L87 Difference]: Start difference. First operand 643 states and 1004 transitions. Second operand 4 states. [2019-09-08 03:43:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:20,238 INFO L93 Difference]: Finished difference Result 1253 states and 1972 transitions. [2019-09-08 03:43:20,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:43:20,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 03:43:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:20,248 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 03:43:20,248 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:43:20,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:43:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-08 03:43:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 03:43:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1003 transitions. [2019-09-08 03:43:20,286 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1003 transitions. Word has length 91 [2019-09-08 03:43:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:20,286 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1003 transitions. [2019-09-08 03:43:20,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1003 transitions. [2019-09-08 03:43:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 03:43:20,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:20,289 INFO L399 BasicCegarLoop]: trace histogram [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:43:20,289 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2113150200, now seen corresponding path program 1 times [2019-09-08 03:43:20,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:20,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:20,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:43:20,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:43:20,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:43:20,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:43:20,458 INFO L87 Difference]: Start difference. First operand 643 states and 1003 transitions. Second operand 10 states. [2019-09-08 03:43:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:20,628 INFO L93 Difference]: Finished difference Result 1258 states and 1979 transitions. [2019-09-08 03:43:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:43:20,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 03:43:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:20,635 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 03:43:20,635 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 03:43:20,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:43:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 03:43:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-09-08 03:43:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-08 03:43:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1013 transitions. [2019-09-08 03:43:20,671 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1013 transitions. Word has length 92 [2019-09-08 03:43:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:20,673 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1013 transitions. [2019-09-08 03:43:20,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:43:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1013 transitions. [2019-09-08 03:43:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 03:43:20,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:20,678 INFO L399 BasicCegarLoop]: trace histogram [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:43:20,678 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2012238233, now seen corresponding path program 1 times [2019-09-08 03:43:20,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:20,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:20,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:43:20,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:43:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:43:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:43:20,795 INFO L87 Difference]: Start difference. First operand 650 states and 1013 transitions. Second operand 4 states. [2019-09-08 03:43:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:20,870 INFO L93 Difference]: Finished difference Result 1259 states and 1980 transitions. [2019-09-08 03:43:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:20,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 03:43:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:20,876 INFO L225 Difference]: With dead ends: 1259 [2019-09-08 03:43:20,876 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 03:43:20,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 03:43:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 03:43:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:43:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1006 transitions. [2019-09-08 03:43:20,907 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1006 transitions. Word has length 92 [2019-09-08 03:43:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:20,907 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 1006 transitions. [2019-09-08 03:43:20,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:43:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1006 transitions. [2019-09-08 03:43:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 03:43:20,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:20,910 INFO L399 BasicCegarLoop]: trace histogram [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:43:20,910 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash 852807042, now seen corresponding path program 1 times [2019-09-08 03:43:20,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:20,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:21,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:21,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:21,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:21,083 INFO L87 Difference]: Start difference. First operand 646 states and 1006 transitions. Second operand 6 states. [2019-09-08 03:43:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:21,355 INFO L93 Difference]: Finished difference Result 1272 states and 2004 transitions. [2019-09-08 03:43:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:21,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 03:43:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:21,361 INFO L225 Difference]: With dead ends: 1272 [2019-09-08 03:43:21,361 INFO L226 Difference]: Without dead ends: 654 [2019-09-08 03:43:21,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-08 03:43:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-09-08 03:43:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 03:43:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-09-08 03:43:21,388 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 93 [2019-09-08 03:43:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:21,388 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-09-08 03:43:21,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-09-08 03:43:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 03:43:21,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:21,390 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:21,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash -535079125, now seen corresponding path program 1 times [2019-09-08 03:43:21,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:21,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:21,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:21,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:21,509 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 6 states. [2019-09-08 03:43:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:21,732 INFO L93 Difference]: Finished difference Result 1235 states and 1919 transitions. [2019-09-08 03:43:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:21,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 03:43:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:21,737 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 03:43:21,738 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 03:43:21,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 03:43:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 03:43:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 03:43:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1003 transitions. [2019-09-08 03:43:21,768 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1003 transitions. Word has length 94 [2019-09-08 03:43:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:21,768 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1003 transitions. [2019-09-08 03:43:21,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1003 transitions. [2019-09-08 03:43:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 03:43:21,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:21,770 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:21,770 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1647609305, now seen corresponding path program 1 times [2019-09-08 03:43:21,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:21,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:21,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:21,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:21,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:21,879 INFO L87 Difference]: Start difference. First operand 651 states and 1003 transitions. Second operand 6 states. [2019-09-08 03:43:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,141 INFO L93 Difference]: Finished difference Result 1235 states and 1915 transitions. [2019-09-08 03:43:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:22,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 03:43:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,146 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 03:43:22,147 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 03:43:22,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 03:43:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-08 03:43:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 03:43:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 999 transitions. [2019-09-08 03:43:22,170 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 999 transitions. Word has length 95 [2019-09-08 03:43:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,171 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 999 transitions. [2019-09-08 03:43:22,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 999 transitions. [2019-09-08 03:43:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 03:43:22,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:22,173 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:22,173 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1752053415, now seen corresponding path program 1 times [2019-09-08 03:43:22,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:22,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:22,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:22,304 INFO L87 Difference]: Start difference. First operand 651 states and 999 transitions. Second operand 7 states. [2019-09-08 03:43:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,408 INFO L93 Difference]: Finished difference Result 1238 states and 1915 transitions. [2019-09-08 03:43:22,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:22,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 03:43:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,416 INFO L225 Difference]: With dead ends: 1238 [2019-09-08 03:43:22,416 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:43:22,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:43:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:43:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2019-09-08 03:43:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:43:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 962 transitions. [2019-09-08 03:43:22,447 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 962 transitions. Word has length 95 [2019-09-08 03:43:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,447 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 962 transitions. [2019-09-08 03:43:22,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 962 transitions. [2019-09-08 03:43:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 03:43:22,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:22,449 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:22,449 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1480928816, now seen corresponding path program 1 times [2019-09-08 03:43:22,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:22,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:22,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:22,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:22,579 INFO L87 Difference]: Start difference. First operand 630 states and 962 transitions. Second operand 6 states. [2019-09-08 03:43:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,699 INFO L93 Difference]: Finished difference Result 1214 states and 1874 transitions. [2019-09-08 03:43:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:22,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 03:43:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,705 INFO L225 Difference]: With dead ends: 1214 [2019-09-08 03:43:22,705 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:43:22,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:43:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 03:43:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:43:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 961 transitions. [2019-09-08 03:43:22,728 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 961 transitions. Word has length 96 [2019-09-08 03:43:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:22,729 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 961 transitions. [2019-09-08 03:43:22,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 961 transitions. [2019-09-08 03:43:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 03:43:22,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:22,731 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:22,731 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1356369204, now seen corresponding path program 1 times [2019-09-08 03:43:22,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:22,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:22,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:22,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:22,838 INFO L87 Difference]: Start difference. First operand 630 states and 961 transitions. Second operand 6 states. [2019-09-08 03:43:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:22,971 INFO L93 Difference]: Finished difference Result 1214 states and 1873 transitions. [2019-09-08 03:43:22,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:22,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 03:43:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:22,977 INFO L225 Difference]: With dead ends: 1214 [2019-09-08 03:43:22,977 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:43:22,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:43:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:43:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 03:43:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:43:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 960 transitions. [2019-09-08 03:43:23,002 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 960 transitions. Word has length 97 [2019-09-08 03:43:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:23,003 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 960 transitions. [2019-09-08 03:43:23,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 960 transitions. [2019-09-08 03:43:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 03:43:23,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,005 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:23,005 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash -156026571, now seen corresponding path program 1 times [2019-09-08 03:43:23,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:43:23,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:43:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:43:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:43:23,275 INFO L87 Difference]: Start difference. First operand 630 states and 960 transitions. Second operand 12 states. [2019-09-08 03:43:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:23,537 INFO L93 Difference]: Finished difference Result 1220 states and 1883 transitions. [2019-09-08 03:43:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:43:23,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 03:43:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:23,544 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 03:43:23,544 INFO L226 Difference]: Without dead ends: 637 [2019-09-08 03:43:23,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-08 03:43:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2019-09-08 03:43:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-08 03:43:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 966 transitions. [2019-09-08 03:43:23,578 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 966 transitions. Word has length 98 [2019-09-08 03:43:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:23,580 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 966 transitions. [2019-09-08 03:43:23,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:43:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 966 transitions. [2019-09-08 03:43:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 03:43:23,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,583 INFO L399 BasicCegarLoop]: trace histogram [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:43:23,583 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1563321933, now seen corresponding path program 1 times [2019-09-08 03:43:23,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:23,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:23,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:23,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:23,753 INFO L87 Difference]: Start difference. First operand 635 states and 966 transitions. Second operand 9 states. [2019-09-08 03:43:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:29,133 INFO L93 Difference]: Finished difference Result 1846 states and 2913 transitions. [2019-09-08 03:43:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:43:29,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 03:43:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:29,143 INFO L225 Difference]: With dead ends: 1846 [2019-09-08 03:43:29,143 INFO L226 Difference]: Without dead ends: 1264 [2019-09-08 03:43:29,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:43:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-09-08 03:43:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2019-09-08 03:43:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-09-08 03:43:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1948 transitions. [2019-09-08 03:43:29,207 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1948 transitions. Word has length 99 [2019-09-08 03:43:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:29,208 INFO L475 AbstractCegarLoop]: Abstraction has 1240 states and 1948 transitions. [2019-09-08 03:43:29,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1948 transitions. [2019-09-08 03:43:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 03:43:29,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:29,209 INFO L399 BasicCegarLoop]: trace histogram [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:43:29,210 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash -202638925, now seen corresponding path program 1 times [2019-09-08 03:43:29,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:29,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:29,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:29,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:29,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:29,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:43:29,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:43:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:43:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:29,370 INFO L87 Difference]: Start difference. First operand 1240 states and 1948 transitions. Second operand 6 states. [2019-09-08 03:43:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:30,133 INFO L93 Difference]: Finished difference Result 2445 states and 3942 transitions. [2019-09-08 03:43:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:43:30,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 03:43:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:30,141 INFO L225 Difference]: With dead ends: 2445 [2019-09-08 03:43:30,141 INFO L226 Difference]: Without dead ends: 1258 [2019-09-08 03:43:30,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-08 03:43:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-08 03:43:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-08 03:43:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1968 transitions. [2019-09-08 03:43:30,210 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1968 transitions. Word has length 100 [2019-09-08 03:43:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:30,210 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1968 transitions. [2019-09-08 03:43:30,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:43:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1968 transitions. [2019-09-08 03:43:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 03:43:30,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:30,212 INFO L399 BasicCegarLoop]: trace histogram [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:43:30,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:30,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1419649865, now seen corresponding path program 1 times [2019-09-08 03:43:30,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:30,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:30,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:30,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:30,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:30,359 INFO L87 Difference]: Start difference. First operand 1256 states and 1968 transitions. Second operand 9 states. [2019-09-08 03:43:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:35,955 INFO L93 Difference]: Finished difference Result 3904 states and 6289 transitions. [2019-09-08 03:43:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:43:35,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 03:43:35,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:35,975 INFO L225 Difference]: With dead ends: 3904 [2019-09-08 03:43:35,975 INFO L226 Difference]: Without dead ends: 2701 [2019-09-08 03:43:35,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:43:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-09-08 03:43:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2646. [2019-09-08 03:43:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2019-09-08 03:43:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 4241 transitions. [2019-09-08 03:43:36,106 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 4241 transitions. Word has length 101 [2019-09-08 03:43:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:36,106 INFO L475 AbstractCegarLoop]: Abstraction has 2646 states and 4241 transitions. [2019-09-08 03:43:36,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 4241 transitions. [2019-09-08 03:43:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 03:43:36,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:36,109 INFO L399 BasicCegarLoop]: trace histogram [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:43:36,109 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash -940794569, now seen corresponding path program 1 times [2019-09-08 03:43:36,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:36,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:36,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:36,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:36,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:36,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:36,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:36,254 INFO L87 Difference]: Start difference. First operand 2646 states and 4241 transitions. Second operand 9 states. [2019-09-08 03:43:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:41,778 INFO L93 Difference]: Finished difference Result 7476 states and 12248 transitions. [2019-09-08 03:43:41,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:43:41,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 03:43:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:41,816 INFO L225 Difference]: With dead ends: 7476 [2019-09-08 03:43:41,816 INFO L226 Difference]: Without dead ends: 4889 [2019-09-08 03:43:41,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:43:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2019-09-08 03:43:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4764. [2019-09-08 03:43:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4764 states. [2019-09-08 03:43:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7713 transitions. [2019-09-08 03:43:42,137 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7713 transitions. Word has length 102 [2019-09-08 03:43:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:42,138 INFO L475 AbstractCegarLoop]: Abstraction has 4764 states and 7713 transitions. [2019-09-08 03:43:42,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7713 transitions. [2019-09-08 03:43:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 03:43:42,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:42,141 INFO L399 BasicCegarLoop]: trace histogram [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:43:42,141 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 865847124, now seen corresponding path program 1 times [2019-09-08 03:43:42,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:42,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:42,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:42,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:42,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:42,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:42,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:42,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:42,263 INFO L87 Difference]: Start difference. First operand 4764 states and 7713 transitions. Second operand 9 states. [2019-09-08 03:43:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:42,481 INFO L93 Difference]: Finished difference Result 7226 states and 11678 transitions. [2019-09-08 03:43:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:43:42,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 03:43:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:42,499 INFO L225 Difference]: With dead ends: 7226 [2019-09-08 03:43:42,499 INFO L226 Difference]: Without dead ends: 2509 [2019-09-08 03:43:42,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:43:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-09-08 03:43:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2019-09-08 03:43:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-09-08 03:43:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 4008 transitions. [2019-09-08 03:43:42,635 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 4008 transitions. Word has length 102 [2019-09-08 03:43:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:42,635 INFO L475 AbstractCegarLoop]: Abstraction has 2507 states and 4008 transitions. [2019-09-08 03:43:42,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4008 transitions. [2019-09-08 03:43:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 03:43:42,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:42,638 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:43:42,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 570306491, now seen corresponding path program 1 times [2019-09-08 03:43:42,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:42,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:43:42,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:43:42,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:42,781 INFO L87 Difference]: Start difference. First operand 2507 states and 4008 transitions. Second operand 9 states. [2019-09-08 03:43:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:48,079 INFO L93 Difference]: Finished difference Result 5637 states and 9158 transitions. [2019-09-08 03:43:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:43:48,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 03:43:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:48,092 INFO L225 Difference]: With dead ends: 5637 [2019-09-08 03:43:48,093 INFO L226 Difference]: Without dead ends: 2327 [2019-09-08 03:43:48,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:43:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-09-08 03:43:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2262. [2019-09-08 03:43:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-09-08 03:43:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3585 transitions. [2019-09-08 03:43:48,201 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3585 transitions. Word has length 103 [2019-09-08 03:43:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:48,201 INFO L475 AbstractCegarLoop]: Abstraction has 2262 states and 3585 transitions. [2019-09-08 03:43:48,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3585 transitions. [2019-09-08 03:43:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:43:48,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:48,210 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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:43:48,210 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1759855622, now seen corresponding path program 1 times [2019-09-08 03:43:48,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:48,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:48,381 INFO L87 Difference]: Start difference. First operand 2262 states and 3585 transitions. Second operand 7 states. [2019-09-08 03:43:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:48,502 INFO L93 Difference]: Finished difference Result 3939 states and 6269 transitions. [2019-09-08 03:43:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:48,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2019-09-08 03:43:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:48,514 INFO L225 Difference]: With dead ends: 3939 [2019-09-08 03:43:48,514 INFO L226 Difference]: Without dead ends: 2260 [2019-09-08 03:43:48,518 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:43:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-09-08 03:43:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2260. [2019-09-08 03:43:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-09-08 03:43:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3578 transitions. [2019-09-08 03:43:48,604 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3578 transitions. Word has length 216 [2019-09-08 03:43:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:48,605 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3578 transitions. [2019-09-08 03:43:48,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3578 transitions. [2019-09-08 03:43:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 03:43:48,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:48,613 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 03:43:48,613 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash -856683070, now seen corresponding path program 1 times [2019-09-08 03:43:48,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:48,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:48,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:48,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:48,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:48,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:48,792 INFO L87 Difference]: Start difference. First operand 2260 states and 3578 transitions. Second operand 7 states. [2019-09-08 03:43:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:48,912 INFO L93 Difference]: Finished difference Result 3938 states and 6266 transitions. [2019-09-08 03:43:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:48,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 217 [2019-09-08 03:43:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:48,934 INFO L225 Difference]: With dead ends: 3938 [2019-09-08 03:43:48,934 INFO L226 Difference]: Without dead ends: 2259 [2019-09-08 03:43:48,938 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:43:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2019-09-08 03:43:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2259. [2019-09-08 03:43:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-09-08 03:43:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3576 transitions. [2019-09-08 03:43:49,025 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3576 transitions. Word has length 217 [2019-09-08 03:43:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:49,026 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3576 transitions. [2019-09-08 03:43:49,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3576 transitions. [2019-09-08 03:43:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 03:43:49,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:49,037 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 03:43:49,037 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1147814942, now seen corresponding path program 1 times [2019-09-08 03:43:49,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:49,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:49,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:49,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:49,223 INFO L87 Difference]: Start difference. First operand 2259 states and 3576 transitions. Second operand 7 states. [2019-09-08 03:43:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:49,347 INFO L93 Difference]: Finished difference Result 3937 states and 6264 transitions. [2019-09-08 03:43:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:49,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-09-08 03:43:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:49,359 INFO L225 Difference]: With dead ends: 3937 [2019-09-08 03:43:49,359 INFO L226 Difference]: Without dead ends: 2258 [2019-09-08 03:43:49,364 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:43:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-09-08 03:43:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2019-09-08 03:43:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-09-08 03:43:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3574 transitions. [2019-09-08 03:43:49,501 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3574 transitions. Word has length 218 [2019-09-08 03:43:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:49,502 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3574 transitions. [2019-09-08 03:43:49,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3574 transitions. [2019-09-08 03:43:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 03:43:49,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:49,512 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 03:43:49,512 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash 941954753, now seen corresponding path program 1 times [2019-09-08 03:43:49,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:49,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:49,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:49,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:43:49,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:43:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:43:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:43:49,675 INFO L87 Difference]: Start difference. First operand 2258 states and 3574 transitions. Second operand 7 states. [2019-09-08 03:43:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:49,784 INFO L93 Difference]: Finished difference Result 3936 states and 6262 transitions. [2019-09-08 03:43:49,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:43:49,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-09-08 03:43:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:49,795 INFO L225 Difference]: With dead ends: 3936 [2019-09-08 03:43:49,795 INFO L226 Difference]: Without dead ends: 2258 [2019-09-08 03:43:49,805 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:43:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-09-08 03:43:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2258. [2019-09-08 03:43:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-09-08 03:43:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3573 transitions. [2019-09-08 03:43:49,886 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3573 transitions. Word has length 218 [2019-09-08 03:43:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:49,886 INFO L475 AbstractCegarLoop]: Abstraction has 2258 states and 3573 transitions. [2019-09-08 03:43:49,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:43:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3573 transitions. [2019-09-08 03:43:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 03:43:49,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:49,893 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-08 03:43:49,893 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1929187870, now seen corresponding path program 1 times [2019-09-08 03:43:49,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:49,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:50,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:50,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:43:50,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:43:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:43:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:50,040 INFO L87 Difference]: Start difference. First operand 2258 states and 3573 transitions. Second operand 5 states. [2019-09-08 03:43:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:50,102 INFO L93 Difference]: Finished difference Result 2261 states and 3575 transitions. [2019-09-08 03:43:50,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:50,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-08 03:43:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:50,109 INFO L225 Difference]: With dead ends: 2261 [2019-09-08 03:43:50,110 INFO L226 Difference]: Without dead ends: 1698 [2019-09-08 03:43:50,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-08 03:43:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2019-09-08 03:43:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1698 states. [2019-09-08 03:43:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2676 transitions. [2019-09-08 03:43:50,174 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2676 transitions. Word has length 219 [2019-09-08 03:43:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:50,175 INFO L475 AbstractCegarLoop]: Abstraction has 1698 states and 2676 transitions. [2019-09-08 03:43:50,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:43:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2676 transitions. [2019-09-08 03:43:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 03:43:50,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:50,184 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:43:50,184 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1807490018, now seen corresponding path program 1 times [2019-09-08 03:43:50,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:50,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 03:43:50,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:50,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:43:50,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:43:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:43:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:50,342 INFO L87 Difference]: Start difference. First operand 1698 states and 2676 transitions. Second operand 5 states. [2019-09-08 03:43:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:50,403 INFO L93 Difference]: Finished difference Result 1701 states and 2678 transitions. [2019-09-08 03:43:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:50,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-09-08 03:43:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:50,413 INFO L225 Difference]: With dead ends: 1701 [2019-09-08 03:43:50,413 INFO L226 Difference]: Without dead ends: 1138 [2019-09-08 03:43:50,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:43:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-09-08 03:43:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-09-08 03:43:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-08 03:43:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1779 transitions. [2019-09-08 03:43:50,452 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1779 transitions. Word has length 221 [2019-09-08 03:43:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:50,453 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1779 transitions. [2019-09-08 03:43:50,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:43:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1779 transitions. [2019-09-08 03:43:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 03:43:50,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:50,461 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:43:50,461 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1544231911, now seen corresponding path program 1 times [2019-09-08 03:43:50,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:50,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:50,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 03:43:50,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:50,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:51,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 3891 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:43:51,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 96 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 03:43:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:43:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-08 03:43:51,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:43:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:43:51,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:43:51,584 INFO L87 Difference]: Start difference. First operand 1138 states and 1779 transitions. Second operand 12 states. [2019-09-08 03:44:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:02,877 INFO L93 Difference]: Finished difference Result 4721 states and 7682 transitions. [2019-09-08 03:44:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:44:02,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 223 [2019-09-08 03:44:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:02,904 INFO L225 Difference]: With dead ends: 4721 [2019-09-08 03:44:02,904 INFO L226 Difference]: Without dead ends: 3641 [2019-09-08 03:44:02,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:44:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-09-08 03:44:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3431. [2019-09-08 03:44:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2019-09-08 03:44:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5478 transitions. [2019-09-08 03:44:03,098 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5478 transitions. Word has length 223 [2019-09-08 03:44:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:03,098 INFO L475 AbstractCegarLoop]: Abstraction has 3431 states and 5478 transitions. [2019-09-08 03:44:03,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:44:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5478 transitions. [2019-09-08 03:44:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-08 03:44:03,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:03,121 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:03,121 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2014239930, now seen corresponding path program 1 times [2019-09-08 03:44:03,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:03,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:03,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:03,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 29 proven. 134 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-09-08 03:44:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:03,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:04,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 5418 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:44:04,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2019-09-08 03:44:04,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:04,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:44:04,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:44:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:44:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:44:04,786 INFO L87 Difference]: Start difference. First operand 3431 states and 5478 transitions. Second operand 14 states. [2019-09-08 03:44:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:10,580 INFO L93 Difference]: Finished difference Result 6927 states and 11246 transitions. [2019-09-08 03:44:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:44:10,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 483 [2019-09-08 03:44:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:10,595 INFO L225 Difference]: With dead ends: 6927 [2019-09-08 03:44:10,596 INFO L226 Difference]: Without dead ends: 3554 [2019-09-08 03:44:10,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 03:44:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-09-08 03:44:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3524. [2019-09-08 03:44:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-08 03:44:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5619 transitions. [2019-09-08 03:44:10,785 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5619 transitions. Word has length 483 [2019-09-08 03:44:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:10,785 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5619 transitions. [2019-09-08 03:44:10,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:44:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5619 transitions. [2019-09-08 03:44:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-09-08 03:44:10,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:10,808 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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:44:10,809 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1274283102, now seen corresponding path program 1 times [2019-09-08 03:44:10,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:10,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 29 proven. 134 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2019-09-08 03:44:11,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:11,196 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:11,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:11,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 5429 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 03:44:11,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 781 proven. 113 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-09-08 03:44:12,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:44:12,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-08 03:44:12,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:44:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:44:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:44:12,101 INFO L87 Difference]: Start difference. First operand 3524 states and 5619 transitions. Second operand 14 states. [2019-09-08 03:44:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:26,289 INFO L93 Difference]: Finished difference Result 9159 states and 14674 transitions. [2019-09-08 03:44:26,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 03:44:26,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 494 [2019-09-08 03:44:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:26,310 INFO L225 Difference]: With dead ends: 9159 [2019-09-08 03:44:26,310 INFO L226 Difference]: Without dead ends: 5693 [2019-09-08 03:44:26,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=2235, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 03:44:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-09-08 03:44:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5393. [2019-09-08 03:44:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5393 states. [2019-09-08 03:44:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5393 states to 5393 states and 8470 transitions. [2019-09-08 03:44:26,598 INFO L78 Accepts]: Start accepts. Automaton has 5393 states and 8470 transitions. Word has length 494 [2019-09-08 03:44:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:26,598 INFO L475 AbstractCegarLoop]: Abstraction has 5393 states and 8470 transitions. [2019-09-08 03:44:26,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:44:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5393 states and 8470 transitions. [2019-09-08 03:44:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-08 03:44:26,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:26,635 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:26,635 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1886189586, now seen corresponding path program 1 times [2019-09-08 03:44:26,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:26,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2019-09-08 03:44:26,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:26,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:27,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 5528 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:44:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 561 proven. 20 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-09-08 03:44:28,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:44:28,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-09-08 03:44:28,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:44:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:44:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:44:28,057 INFO L87 Difference]: Start difference. First operand 5393 states and 8470 transitions. Second operand 18 states. [2019-09-08 03:44:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:41,716 INFO L93 Difference]: Finished difference Result 11261 states and 17556 transitions. [2019-09-08 03:44:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 03:44:41,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 526 [2019-09-08 03:44:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:41,745 INFO L225 Difference]: With dead ends: 11261 [2019-09-08 03:44:41,745 INFO L226 Difference]: Without dead ends: 5914 [2019-09-08 03:44:41,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:44:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-09-08 03:44:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5720. [2019-09-08 03:44:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5720 states. [2019-09-08 03:44:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 8707 transitions. [2019-09-08 03:44:42,036 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 8707 transitions. Word has length 526 [2019-09-08 03:44:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:42,037 INFO L475 AbstractCegarLoop]: Abstraction has 5720 states and 8707 transitions. [2019-09-08 03:44:42,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:44:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 8707 transitions. [2019-09-08 03:44:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-09-08 03:44:42,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:42,054 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:42,054 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2002040255, now seen corresponding path program 1 times [2019-09-08 03:44:42,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:42,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:42,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2019-09-08 03:44:42,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:42,495 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:44:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:43,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 6434 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:43,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2019-09-08 03:44:43,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:43,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:44:43,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:43,859 INFO L87 Difference]: Start difference. First operand 5720 states and 8707 transitions. Second operand 9 states. [2019-09-08 03:44:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:44,439 INFO L93 Difference]: Finished difference Result 11429 states and 17594 transitions. [2019-09-08 03:44:44,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:44:44,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 599 [2019-09-08 03:44:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:44,464 INFO L225 Difference]: With dead ends: 11429 [2019-09-08 03:44:44,464 INFO L226 Difference]: Without dead ends: 5776 [2019-09-08 03:44:44,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:44:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2019-09-08 03:44:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 5776. [2019-09-08 03:44:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-09-08 03:44:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 8779 transitions. [2019-09-08 03:44:44,777 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 8779 transitions. Word has length 599 [2019-09-08 03:44:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:44,777 INFO L475 AbstractCegarLoop]: Abstraction has 5776 states and 8779 transitions. [2019-09-08 03:44:44,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 8779 transitions. [2019-09-08 03:44:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2019-09-08 03:44:44,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:44,804 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:44,804 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 172710106, now seen corresponding path program 1 times [2019-09-08 03:44:44,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 38 proven. 113 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2019-09-08 03:44:45,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:45,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:44:45,195 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:44:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:46,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 6449 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:46,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:44:46,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:46,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:44:46,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:44:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:44:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:44:46,285 INFO L87 Difference]: Start difference. First operand 5776 states and 8779 transitions. Second operand 6 states. [2019-09-08 03:44:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:46,601 INFO L93 Difference]: Finished difference Result 11561 states and 17774 transitions. [2019-09-08 03:44:46,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:44:46,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 614 [2019-09-08 03:44:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:46,617 INFO L225 Difference]: With dead ends: 11561 [2019-09-08 03:44:46,617 INFO L226 Difference]: Without dead ends: 5852 [2019-09-08 03:44:46,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 615 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:44:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2019-09-08 03:44:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 5852. [2019-09-08 03:44:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-09-08 03:44:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 8871 transitions. [2019-09-08 03:44:46,888 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 8871 transitions. Word has length 614 [2019-09-08 03:44:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:46,888 INFO L475 AbstractCegarLoop]: Abstraction has 5852 states and 8871 transitions. [2019-09-08 03:44:46,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:44:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 8871 transitions. [2019-09-08 03:44:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2019-09-08 03:44:46,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:46,907 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,907 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:46,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1113636405, now seen corresponding path program 1 times [2019-09-08 03:44:46,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:46,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:46,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:46,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:46,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 44 proven. 112 refuted. 0 times theorem prover too weak. 1403 trivial. 0 not checked. [2019-09-08 03:44:47,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:47,345 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) [2019-09-08 03:44:47,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:48,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 6652 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:44:48,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2019-09-08 03:44:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:48,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 03:44:48,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:44:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:44:48,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:44:48,398 INFO L87 Difference]: Start difference. First operand 5852 states and 8871 transitions. Second operand 5 states. [2019-09-08 03:44:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:49,032 INFO L93 Difference]: Finished difference Result 15050 states and 23340 transitions. [2019-09-08 03:44:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:44:49,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 659 [2019-09-08 03:44:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:49,061 INFO L225 Difference]: With dead ends: 15050 [2019-09-08 03:44:49,061 INFO L226 Difference]: Without dead ends: 9265 [2019-09-08 03:44:49,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 661 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9265 states. [2019-09-08 03:44:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9265 to 9262. [2019-09-08 03:44:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9262 states. [2019-09-08 03:44:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 14138 transitions. [2019-09-08 03:44:49,416 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 14138 transitions. Word has length 659 [2019-09-08 03:44:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:49,416 INFO L475 AbstractCegarLoop]: Abstraction has 9262 states and 14138 transitions. [2019-09-08 03:44:49,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:44:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 14138 transitions. [2019-09-08 03:44:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-09-08 03:44:49,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:49,429 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:49,429 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash -20204127, now seen corresponding path program 1 times [2019-09-08 03:44:49,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:49,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 51 proven. 107 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2019-09-08 03:44:49,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:49,755 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) [2019-09-08 03:44:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:50,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 6470 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:50,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2019-09-08 03:44:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:44:50,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:44:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:44:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:44:50,867 INFO L87 Difference]: Start difference. First operand 9262 states and 14138 transitions. Second operand 6 states. [2019-09-08 03:44:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:51,309 INFO L93 Difference]: Finished difference Result 18631 states and 28856 transitions. [2019-09-08 03:44:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:44:51,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 635 [2019-09-08 03:44:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:51,344 INFO L225 Difference]: With dead ends: 18631 [2019-09-08 03:44:51,345 INFO L226 Difference]: Without dead ends: 9436 [2019-09-08 03:44:51,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 636 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:44:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9436 states. [2019-09-08 03:44:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9436 to 9436. [2019-09-08 03:44:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9436 states. [2019-09-08 03:44:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9436 states to 9436 states and 14336 transitions. [2019-09-08 03:44:51,787 INFO L78 Accepts]: Start accepts. Automaton has 9436 states and 14336 transitions. Word has length 635 [2019-09-08 03:44:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:51,788 INFO L475 AbstractCegarLoop]: Abstraction has 9436 states and 14336 transitions. [2019-09-08 03:44:51,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:44:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9436 states and 14336 transitions. [2019-09-08 03:44:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-08 03:44:51,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:51,797 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:44:51,798 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1516654317, now seen corresponding path program 1 times [2019-09-08 03:44:51,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 42 proven. 152 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2019-09-08 03:44:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:52,213 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:44:52,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:53,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 6458 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:44:53,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2019-09-08 03:44:53,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:53,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:44:53,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:44:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:44:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:44:53,361 INFO L87 Difference]: Start difference. First operand 9436 states and 14336 transitions. Second operand 11 states. [2019-09-08 03:45:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:03,949 INFO L93 Difference]: Finished difference Result 31289 states and 49486 transitions. [2019-09-08 03:45:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 03:45:03,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 641 [2019-09-08 03:45:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:04,016 INFO L225 Difference]: With dead ends: 31289 [2019-09-08 03:45:04,016 INFO L226 Difference]: Without dead ends: 20927 [2019-09-08 03:45:04,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:45:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20927 states. [2019-09-08 03:45:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20927 to 20219. [2019-09-08 03:45:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20219 states. [2019-09-08 03:45:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20219 states to 20219 states and 30883 transitions. [2019-09-08 03:45:06,149 INFO L78 Accepts]: Start accepts. Automaton has 20219 states and 30883 transitions. Word has length 641 [2019-09-08 03:45:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:06,150 INFO L475 AbstractCegarLoop]: Abstraction has 20219 states and 30883 transitions. [2019-09-08 03:45:06,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20219 states and 30883 transitions. [2019-09-08 03:45:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-08 03:45:06,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:06,168 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,168 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -303936602, now seen corresponding path program 1 times [2019-09-08 03:45:06,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 59 proven. 101 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2019-09-08 03:45:06,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:06,559 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:45:06,583 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:45:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:07,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 6668 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:07,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-09-08 03:45:07,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:07,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:07,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:07,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:07,570 INFO L87 Difference]: Start difference. First operand 20219 states and 30883 transitions. Second operand 8 states. [2019-09-08 03:45:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:08,617 INFO L93 Difference]: Finished difference Result 40740 states and 63145 transitions. [2019-09-08 03:45:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:45:08,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2019-09-08 03:45:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:08,681 INFO L225 Difference]: With dead ends: 40740 [2019-09-08 03:45:08,681 INFO L226 Difference]: Without dead ends: 20588 [2019-09-08 03:45:08,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 678 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:45:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20588 states. [2019-09-08 03:45:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20588 to 20588. [2019-09-08 03:45:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20588 states. [2019-09-08 03:45:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20588 states to 20588 states and 31273 transitions. [2019-09-08 03:45:09,399 INFO L78 Accepts]: Start accepts. Automaton has 20588 states and 31273 transitions. Word has length 675 [2019-09-08 03:45:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:09,399 INFO L475 AbstractCegarLoop]: Abstraction has 20588 states and 31273 transitions. [2019-09-08 03:45:09,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20588 states and 31273 transitions. [2019-09-08 03:45:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2019-09-08 03:45:09,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:09,412 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:45:09,412 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -587858725, now seen corresponding path program 1 times [2019-09-08 03:45:09,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:09,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 60 proven. 44 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-09-08 03:45:09,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:09,799 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:09,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:10,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 6481 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:10,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2019-09-08 03:45:11,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:11,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 03:45:11,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:45:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:45:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:45:11,083 INFO L87 Difference]: Start difference. First operand 20588 states and 31273 transitions. Second operand 10 states. [2019-09-08 03:45:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:15,435 INFO L93 Difference]: Finished difference Result 36434 states and 56269 transitions. [2019-09-08 03:45:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:45:15,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 646 [2019-09-08 03:45:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:15,503 INFO L225 Difference]: With dead ends: 36434 [2019-09-08 03:45:15,504 INFO L226 Difference]: Without dead ends: 21401 [2019-09-08 03:45:15,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:45:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21401 states. [2019-09-08 03:45:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21401 to 21173. [2019-09-08 03:45:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21173 states. [2019-09-08 03:45:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21173 states to 21173 states and 32335 transitions. [2019-09-08 03:45:16,475 INFO L78 Accepts]: Start accepts. Automaton has 21173 states and 32335 transitions. Word has length 646 [2019-09-08 03:45:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:16,476 INFO L475 AbstractCegarLoop]: Abstraction has 21173 states and 32335 transitions. [2019-09-08 03:45:16,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:45:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 21173 states and 32335 transitions. [2019-09-08 03:45:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-08 03:45:16,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:16,494 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:45:16,494 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash 234927211, now seen corresponding path program 1 times [2019-09-08 03:45:16,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:16,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2019-09-08 03:45:16,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:16,889 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:17,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 6348 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:17,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-08 03:45:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:17,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:45:17,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:17,876 INFO L87 Difference]: Start difference. First operand 21173 states and 32335 transitions. Second operand 7 states. [2019-09-08 03:45:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:26,775 INFO L93 Difference]: Finished difference Result 70753 states and 115666 transitions. [2019-09-08 03:45:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:45:26,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 641 [2019-09-08 03:45:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:26,937 INFO L225 Difference]: With dead ends: 70753 [2019-09-08 03:45:26,937 INFO L226 Difference]: Without dead ends: 49581 [2019-09-08 03:45:26,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:45:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49581 states. [2019-09-08 03:45:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49581 to 47874. [2019-09-08 03:45:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47874 states. [2019-09-08 03:45:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47874 states to 47874 states and 75616 transitions. [2019-09-08 03:45:28,656 INFO L78 Accepts]: Start accepts. Automaton has 47874 states and 75616 transitions. Word has length 641 [2019-09-08 03:45:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:28,657 INFO L475 AbstractCegarLoop]: Abstraction has 47874 states and 75616 transitions. [2019-09-08 03:45:28,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47874 states and 75616 transitions. [2019-09-08 03:45:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2019-09-08 03:45:28,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:28,678 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:45:28,678 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1967986716, now seen corresponding path program 1 times [2019-09-08 03:45:28,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2019-09-08 03:45:29,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:29,420 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:45:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:30,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 6349 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:30,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-09-08 03:45:30,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:30,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:45:30,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:30,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:30,483 INFO L87 Difference]: Start difference. First operand 47874 states and 75616 transitions. Second operand 7 states. [2019-09-08 03:45:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:41,953 INFO L93 Difference]: Finished difference Result 179850 states and 334257 transitions. [2019-09-08 03:45:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:45:41,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 642 [2019-09-08 03:45:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:42,608 INFO L225 Difference]: With dead ends: 179850 [2019-09-08 03:45:42,608 INFO L226 Difference]: Without dead ends: 131837 [2019-09-08 03:45:46,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:45:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131837 states. [2019-09-08 03:45:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131837 to 127346. [2019-09-08 03:45:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127346 states. [2019-09-08 03:45:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127346 states to 127346 states and 221150 transitions. [2019-09-08 03:45:55,357 INFO L78 Accepts]: Start accepts. Automaton has 127346 states and 221150 transitions. Word has length 642 [2019-09-08 03:45:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:55,358 INFO L475 AbstractCegarLoop]: Abstraction has 127346 states and 221150 transitions. [2019-09-08 03:45:55,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 127346 states and 221150 transitions. [2019-09-08 03:45:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2019-09-08 03:45:55,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:55,378 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:45:55,379 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2008730617, now seen corresponding path program 1 times [2019-09-08 03:45:55,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:55,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:55,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:55,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:55,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 30 proven. 62 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-09-08 03:45:56,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:56,482 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:45:56,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:57,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 6350 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:57,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2019-09-08 03:45:57,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:57,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:45:57,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:57,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:57,483 INFO L87 Difference]: Start difference. First operand 127346 states and 221150 transitions. Second operand 7 states. [2019-09-08 03:46:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:37,493 INFO L93 Difference]: Finished difference Result 512464 states and 1316832 transitions. [2019-09-08 03:46:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:46:37,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 643 [2019-09-08 03:46:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:40,910 INFO L225 Difference]: With dead ends: 512464 [2019-09-08 03:46:40,910 INFO L226 Difference]: Without dead ends: 384613 [2019-09-08 03:46:41,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:46:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384613 states. [2019-09-08 03:47:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384613 to 371602. [2019-09-08 03:47:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371602 states. [2019-09-08 03:47:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371602 states to 371602 states and 820646 transitions. [2019-09-08 03:47:40,303 INFO L78 Accepts]: Start accepts. Automaton has 371602 states and 820646 transitions. Word has length 643 [2019-09-08 03:47:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:40,303 INFO L475 AbstractCegarLoop]: Abstraction has 371602 states and 820646 transitions. [2019-09-08 03:47:40,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:47:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 371602 states and 820646 transitions. [2019-09-08 03:47:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-09-08 03:47:40,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:40,343 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:47:40,343 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1004345082, now seen corresponding path program 1 times [2019-09-08 03:47:40,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:40,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:40,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:40,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-09-08 03:47:40,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:40,740 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:47:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:42,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 6676 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 03:47:42,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 787 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2019-09-08 03:47:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:42,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-08 03:47:42,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:47:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:47:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:47:42,930 INFO L87 Difference]: Start difference. First operand 371602 states and 820646 transitions. Second operand 12 states.