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_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:02:34,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:02:34,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:02:34,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:02:34,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:02:34,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:02:34,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:02:34,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:02:34,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:02:34,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:02:34,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:02:34,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:02:34,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:02:34,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:02:34,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:02:34,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:02:34,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:02:34,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:02:34,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:02:34,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:02:34,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:02:34,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:02:34,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:02:34,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:02:34,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:02:34,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:02:34,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:02:34,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:02:34,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:02:34,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:02:34,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:02:34,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:02:34,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:02:34,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:02:34,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:02:34,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:02:34,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:02:34,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:02:34,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:02:34,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:02:34,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:02:34,238 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 04:02:34,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:02:34,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:02:34,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:02:34,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:02:34,254 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:02:34,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:02:34,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:02:34,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:02:34,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:02:34,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:02:34,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:02:34,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:02:34,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:02:34,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:02:34,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:02:34,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:02:34,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:02:34,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:02:34,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:02:34,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:02:34,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:02:34,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:02:34,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:02:34,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:02:34,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:02:34,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:02:34,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:02:34,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:02:34,321 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:02:34,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-09-08 04:02:34,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12754c53/8bfdc9c09d5e4794956b71bac1d6d055/FLAGf9eafb39d [2019-09-08 04:02:35,026 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:02:35,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-09-08 04:02:35,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12754c53/8bfdc9c09d5e4794956b71bac1d6d055/FLAGf9eafb39d [2019-09-08 04:02:35,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12754c53/8bfdc9c09d5e4794956b71bac1d6d055 [2019-09-08 04:02:35,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:02:35,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:02:35,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:02:35,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:02:35,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:02:35,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:35" (1/1) ... [2019-09-08 04:02:35,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd7f237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:35, skipping insertion in model container [2019-09-08 04:02:35,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:35" (1/1) ... [2019-09-08 04:02:35,238 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:02:35,325 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:02:36,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:02:36,020 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:02:36,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:02:36,212 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:02:36,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36 WrapperNode [2019-09-08 04:02:36,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:02:36,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:02:36,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:02:36,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:02:36,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (1/1) ... [2019-09-08 04:02:36,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:02:36,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:02:36,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:02:36,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:02:36,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (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 04:02:36,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:02:36,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:02:36,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:02:36,484 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:02:36,484 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:02:36,484 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:02:36,484 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:02:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:02:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:02:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:02:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:02:36,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:02:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:02:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:02:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:02:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:02:36,486 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:02:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:02:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:02:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:02:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:02:36,487 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:02:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:02:36,489 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:02:36,490 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:02:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:02:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:02:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:02:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:02:36,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:02:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:02:36,496 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:02:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:02:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:02:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:02:36,496 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:02:36,497 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:02:36,498 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:02:36,499 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:02:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:02:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:02:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:02:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:02:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:02:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:02:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:02:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:02:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:02:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:02:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:02:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:02:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:02:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:02:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:02:38,724 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:02:38,725 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:02:38,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:02:38 BoogieIcfgContainer [2019-09-08 04:02:38,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:02:38,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:02:38,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:02:38,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:02:38,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:02:35" (1/3) ... [2019-09-08 04:02:38,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96ea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:02:38, skipping insertion in model container [2019-09-08 04:02:38,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:36" (2/3) ... [2019-09-08 04:02:38,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96ea6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:02:38, skipping insertion in model container [2019-09-08 04:02:38,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:02:38" (3/3) ... [2019-09-08 04:02:38,734 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-09-08 04:02:38,744 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:02:38,753 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:02:38,769 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:02:38,812 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:02:38,813 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:02:38,813 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:02:38,813 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:02:38,813 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:02:38,813 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:02:38,813 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:02:38,813 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:02:38,814 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:02:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states. [2019-09-08 04:02:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 04:02:38,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:38,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:38,892 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:38,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1835526368, now seen corresponding path program 1 times [2019-09-08 04:02:38,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:38,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:38,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:39,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:39,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:39,436 INFO L87 Difference]: Start difference. First operand 742 states. Second operand 4 states. [2019-09-08 04:02:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:39,604 INFO L93 Difference]: Finished difference Result 1147 states and 1871 transitions. [2019-09-08 04:02:39,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:39,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-08 04:02:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:39,702 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 04:02:39,702 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 04:02:39,712 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 04:02:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 04:02:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 04:02:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 04:02:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 937 transitions. [2019-09-08 04:02:39,837 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 937 transitions. Word has length 107 [2019-09-08 04:02:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:39,838 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 937 transitions. [2019-09-08 04:02:39,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 937 transitions. [2019-09-08 04:02:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 04:02:39,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:39,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:39,851 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 443776321, now seen corresponding path program 1 times [2019-09-08 04:02:39,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:40,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:40,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:40,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:40,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:40,069 INFO L87 Difference]: Start difference. First operand 582 states and 937 transitions. Second operand 4 states. [2019-09-08 04:02:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:40,138 INFO L93 Difference]: Finished difference Result 1127 states and 1832 transitions. [2019-09-08 04:02:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:40,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-08 04:02:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:40,146 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 04:02:40,146 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 04:02:40,149 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 04:02:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 04:02:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 04:02:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 04:02:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 936 transitions. [2019-09-08 04:02:40,200 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 936 transitions. Word has length 110 [2019-09-08 04:02:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:40,200 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 936 transitions. [2019-09-08 04:02:40,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 936 transitions. [2019-09-08 04:02:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 04:02:40,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:40,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:40,213 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 15474447, now seen corresponding path program 1 times [2019-09-08 04:02:40,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:40,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:40,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:40,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:40,365 INFO L87 Difference]: Start difference. First operand 582 states and 936 transitions. Second operand 4 states. [2019-09-08 04:02:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:40,449 INFO L93 Difference]: Finished difference Result 1127 states and 1831 transitions. [2019-09-08 04:02:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:40,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-08 04:02:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:40,457 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 04:02:40,457 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 04:02:40,460 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 04:02:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 04:02:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 04:02:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 04:02:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 935 transitions. [2019-09-08 04:02:40,503 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 935 transitions. Word has length 111 [2019-09-08 04:02:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:40,503 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 935 transitions. [2019-09-08 04:02:40,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 935 transitions. [2019-09-08 04:02:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 04:02:40,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:40,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:40,509 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1301085565, now seen corresponding path program 1 times [2019-09-08 04:02:40,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:40,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:40,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:40,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:40,732 INFO L87 Difference]: Start difference. First operand 582 states and 935 transitions. Second operand 4 states. [2019-09-08 04:02:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:40,806 INFO L93 Difference]: Finished difference Result 1127 states and 1830 transitions. [2019-09-08 04:02:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:40,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-08 04:02:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:40,814 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 04:02:40,814 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 04:02:40,817 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 04:02:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 04:02:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 04:02:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 04:02:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 934 transitions. [2019-09-08 04:02:40,847 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 934 transitions. Word has length 112 [2019-09-08 04:02:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:40,848 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 934 transitions. [2019-09-08 04:02:40,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 934 transitions. [2019-09-08 04:02:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 04:02:40,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:40,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:40,852 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash -116575413, now seen corresponding path program 1 times [2019-09-08 04:02:40,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:40,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:40,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:40,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:40,985 INFO L87 Difference]: Start difference. First operand 582 states and 934 transitions. Second operand 4 states. [2019-09-08 04:02:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:41,043 INFO L93 Difference]: Finished difference Result 1127 states and 1829 transitions. [2019-09-08 04:02:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:41,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-08 04:02:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:41,054 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 04:02:41,054 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 04:02:41,060 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 04:02:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 04:02:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-08 04:02:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 04:02:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 933 transitions. [2019-09-08 04:02:41,083 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 933 transitions. Word has length 113 [2019-09-08 04:02:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:41,084 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 933 transitions. [2019-09-08 04:02:41,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 933 transitions. [2019-09-08 04:02:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 04:02:41,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:41,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:41,091 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash 563674553, now seen corresponding path program 1 times [2019-09-08 04:02:41,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:41,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:02:41,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:02:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:02:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:02:41,306 INFO L87 Difference]: Start difference. First operand 582 states and 933 transitions. Second operand 10 states. [2019-09-08 04:02:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:41,482 INFO L93 Difference]: Finished difference Result 1085 states and 1749 transitions. [2019-09-08 04:02:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:02:41,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-09-08 04:02:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:41,491 INFO L225 Difference]: With dead ends: 1085 [2019-09-08 04:02:41,491 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:41,497 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 04:02:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-09-08 04:02:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:02:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-09-08 04:02:41,538 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-09-08 04:02:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:41,540 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-09-08 04:02:41,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:02:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-09-08 04:02:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 04:02:41,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:41,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:41,548 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 983191384, now seen corresponding path program 1 times [2019-09-08 04:02:41,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:41,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:41,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:41,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:41,714 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-09-08 04:02:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:41,770 INFO L93 Difference]: Finished difference Result 1133 states and 1835 transitions. [2019-09-08 04:02:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:41,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 04:02:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:41,776 INFO L225 Difference]: With dead ends: 1133 [2019-09-08 04:02:41,776 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 04:02:41,779 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 04:02:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 04:02:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 04:02:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 04:02:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 919 transitions. [2019-09-08 04:02:41,801 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 919 transitions. Word has length 114 [2019-09-08 04:02:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:41,801 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 919 transitions. [2019-09-08 04:02:41,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 919 transitions. [2019-09-08 04:02:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 04:02:41,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:41,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:41,806 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:41,806 INFO L82 PathProgramCache]: Analyzing trace with hash 881745063, now seen corresponding path program 1 times [2019-09-08 04:02:41,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:41,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:41,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:41,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:41,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:41,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:41,927 INFO L87 Difference]: Start difference. First operand 576 states and 919 transitions. Second operand 6 states. [2019-09-08 04:02:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:42,130 INFO L93 Difference]: Finished difference Result 1073 states and 1727 transitions. [2019-09-08 04:02:42,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:42,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-08 04:02:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:42,136 INFO L225 Difference]: With dead ends: 1073 [2019-09-08 04:02:42,136 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 04:02:42,139 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 04:02:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 04:02:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 04:02:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 04:02:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 915 transitions. [2019-09-08 04:02:42,160 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 915 transitions. Word has length 115 [2019-09-08 04:02:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:42,160 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 915 transitions. [2019-09-08 04:02:42,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 915 transitions. [2019-09-08 04:02:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:02:42,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:42,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:42,164 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2138395236, now seen corresponding path program 1 times [2019-09-08 04:02:42,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:42,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:42,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:42,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:42,285 INFO L87 Difference]: Start difference. First operand 576 states and 915 transitions. Second operand 6 states. [2019-09-08 04:02:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:42,526 INFO L93 Difference]: Finished difference Result 1073 states and 1723 transitions. [2019-09-08 04:02:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:42,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-09-08 04:02:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:42,532 INFO L225 Difference]: With dead ends: 1073 [2019-09-08 04:02:42,532 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 04:02:42,535 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 04:02:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 04:02:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 04:02:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 04:02:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 911 transitions. [2019-09-08 04:02:42,562 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 911 transitions. Word has length 116 [2019-09-08 04:02:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:42,563 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 911 transitions. [2019-09-08 04:02:42,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 911 transitions. [2019-09-08 04:02:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 04:02:42,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:42,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:42,567 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash 603126668, now seen corresponding path program 1 times [2019-09-08 04:02:42,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:42,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:42,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:42,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:42,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:42,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:42,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:42,696 INFO L87 Difference]: Start difference. First operand 576 states and 911 transitions. Second operand 6 states. [2019-09-08 04:02:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:42,867 INFO L93 Difference]: Finished difference Result 1073 states and 1719 transitions. [2019-09-08 04:02:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:42,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-08 04:02:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:42,872 INFO L225 Difference]: With dead ends: 1073 [2019-09-08 04:02:42,872 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 04:02:42,875 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 04:02:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 04:02:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-08 04:02:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 04:02:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 907 transitions. [2019-09-08 04:02:42,897 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 907 transitions. Word has length 117 [2019-09-08 04:02:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:42,897 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 907 transitions. [2019-09-08 04:02:42,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 907 transitions. [2019-09-08 04:02:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 04:02:42,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:42,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:42,901 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1057986572, now seen corresponding path program 1 times [2019-09-08 04:02:42,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:42,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:02:43,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:02:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:02:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:02:43,047 INFO L87 Difference]: Start difference. First operand 576 states and 907 transitions. Second operand 7 states. [2019-09-08 04:02:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:43,153 INFO L93 Difference]: Finished difference Result 1073 states and 1715 transitions. [2019-09-08 04:02:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:02:43,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 04:02:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:43,158 INFO L225 Difference]: With dead ends: 1073 [2019-09-08 04:02:43,159 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 04:02:43,162 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 04:02:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 04:02:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-08 04:02:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-08 04:02:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 873 transitions. [2019-09-08 04:02:43,181 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 873 transitions. Word has length 117 [2019-09-08 04:02:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:43,182 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 873 transitions. [2019-09-08 04:02:43,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:02:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 873 transitions. [2019-09-08 04:02:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:02:43,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:43,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:43,185 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1567550433, now seen corresponding path program 1 times [2019-09-08 04:02:43,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:43,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:43,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:43,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:43,301 INFO L87 Difference]: Start difference. First operand 555 states and 873 transitions. Second operand 6 states. [2019-09-08 04:02:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:43,393 INFO L93 Difference]: Finished difference Result 1052 states and 1681 transitions. [2019-09-08 04:02:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:43,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 04:02:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:43,398 INFO L225 Difference]: With dead ends: 1052 [2019-09-08 04:02:43,398 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 04:02:43,401 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 04:02:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 04:02:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-08 04:02:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-08 04:02:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 872 transitions. [2019-09-08 04:02:43,427 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 872 transitions. Word has length 118 [2019-09-08 04:02:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:43,429 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 872 transitions. [2019-09-08 04:02:43,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 872 transitions. [2019-09-08 04:02:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 04:02:43,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:43,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:43,433 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1018460559, now seen corresponding path program 1 times [2019-09-08 04:02:43,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:43,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:43,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:43,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:43,622 INFO L87 Difference]: Start difference. First operand 555 states and 872 transitions. Second operand 6 states. [2019-09-08 04:02:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:43,707 INFO L93 Difference]: Finished difference Result 1052 states and 1680 transitions. [2019-09-08 04:02:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:43,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-08 04:02:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:43,712 INFO L225 Difference]: With dead ends: 1052 [2019-09-08 04:02:43,712 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 04:02:43,715 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 04:02:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 04:02:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-08 04:02:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-08 04:02:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 871 transitions. [2019-09-08 04:02:43,734 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 871 transitions. Word has length 119 [2019-09-08 04:02:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:43,734 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 871 transitions. [2019-09-08 04:02:43,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 871 transitions. [2019-09-08 04:02:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 04:02:43,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:43,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:43,739 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1998799322, now seen corresponding path program 1 times [2019-09-08 04:02:43,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:43,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:43,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:43,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:02:43,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:02:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:02:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:02:43,922 INFO L87 Difference]: Start difference. First operand 555 states and 871 transitions. Second operand 12 states. [2019-09-08 04:02:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:44,148 INFO L93 Difference]: Finished difference Result 1053 states and 1679 transitions. [2019-09-08 04:02:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:02:44,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-09-08 04:02:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:44,154 INFO L225 Difference]: With dead ends: 1053 [2019-09-08 04:02:44,154 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 04:02:44,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:02:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 04:02:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-09-08 04:02:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-08 04:02:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 870 transitions. [2019-09-08 04:02:44,181 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 870 transitions. Word has length 120 [2019-09-08 04:02:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:44,181 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 870 transitions. [2019-09-08 04:02:44,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:02:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 870 transitions. [2019-09-08 04:02:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 04:02:44,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:44,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:44,187 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 504527096, now seen corresponding path program 1 times [2019-09-08 04:02:44,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:44,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:02:44,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:02:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:02:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:02:44,396 INFO L87 Difference]: Start difference. First operand 555 states and 870 transitions. Second operand 9 states. [2019-09-08 04:02:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:47,808 INFO L93 Difference]: Finished difference Result 1050 states and 1693 transitions. [2019-09-08 04:02:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:02:47,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 04:02:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:47,814 INFO L225 Difference]: With dead ends: 1050 [2019-09-08 04:02:47,814 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 04:02:47,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:02:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 04:02:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-09-08 04:02:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-08 04:02:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 889 transitions. [2019-09-08 04:02:47,874 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 889 transitions. Word has length 121 [2019-09-08 04:02:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:47,874 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 889 transitions. [2019-09-08 04:02:47,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:02:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 889 transitions. [2019-09-08 04:02:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 04:02:47,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:47,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:47,878 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:47,878 INFO L82 PathProgramCache]: Analyzing trace with hash -250381492, now seen corresponding path program 1 times [2019-09-08 04:02:47,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:47,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:47,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:48,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:02:48,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:02:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:02:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:02:48,032 INFO L87 Difference]: Start difference. First operand 559 states and 889 transitions. Second operand 8 states. [2019-09-08 04:02:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:53,657 INFO L93 Difference]: Finished difference Result 1962 states and 3248 transitions. [2019-09-08 04:02:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:02:53,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-08 04:02:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:53,671 INFO L225 Difference]: With dead ends: 1962 [2019-09-08 04:02:53,671 INFO L226 Difference]: Without dead ends: 1469 [2019-09-08 04:02:53,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:02:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-09-08 04:02:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1430. [2019-09-08 04:02:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-09-08 04:02:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2296 transitions. [2019-09-08 04:02:53,740 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2296 transitions. Word has length 122 [2019-09-08 04:02:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:53,741 INFO L475 AbstractCegarLoop]: Abstraction has 1430 states and 2296 transitions. [2019-09-08 04:02:53,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:02:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2296 transitions. [2019-09-08 04:02:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 04:02:53,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:53,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:53,745 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:53,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1214123081, now seen corresponding path program 1 times [2019-09-08 04:02:53,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:53,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:53,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:53,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:02:53,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:02:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:02:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:02:53,886 INFO L87 Difference]: Start difference. First operand 1430 states and 2296 transitions. Second operand 9 states. [2019-09-08 04:03:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:00,530 INFO L93 Difference]: Finished difference Result 4504 states and 7422 transitions. [2019-09-08 04:03:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:03:00,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 04:03:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:00,555 INFO L225 Difference]: With dead ends: 4504 [2019-09-08 04:03:00,556 INFO L226 Difference]: Without dead ends: 3140 [2019-09-08 04:03:00,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:03:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-09-08 04:03:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2917. [2019-09-08 04:03:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-09-08 04:03:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4711 transitions. [2019-09-08 04:03:00,707 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4711 transitions. Word has length 128 [2019-09-08 04:03:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:00,707 INFO L475 AbstractCegarLoop]: Abstraction has 2917 states and 4711 transitions. [2019-09-08 04:03:00,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:03:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4711 transitions. [2019-09-08 04:03:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 04:03:00,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:00,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:00,711 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:00,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1206363722, now seen corresponding path program 1 times [2019-09-08 04:03:00,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:00,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:00,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:00,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:00,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:03:00,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:03:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:03:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:03:00,837 INFO L87 Difference]: Start difference. First operand 2917 states and 4711 transitions. Second operand 5 states. [2019-09-08 04:03:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:03,347 INFO L93 Difference]: Finished difference Result 6396 states and 10301 transitions. [2019-09-08 04:03:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:03:03,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-08 04:03:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:03,380 INFO L225 Difference]: With dead ends: 6396 [2019-09-08 04:03:03,381 INFO L226 Difference]: Without dead ends: 4288 [2019-09-08 04:03:03,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-09-08 04:03:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4261. [2019-09-08 04:03:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-09-08 04:03:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6797 transitions. [2019-09-08 04:03:03,604 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6797 transitions. Word has length 128 [2019-09-08 04:03:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:03,606 INFO L475 AbstractCegarLoop]: Abstraction has 4261 states and 6797 transitions. [2019-09-08 04:03:03,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:03:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6797 transitions. [2019-09-08 04:03:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 04:03:03,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:03,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:03,611 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1039215732, now seen corresponding path program 1 times [2019-09-08 04:03:03,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:03,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:03,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:03,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:03,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:03,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:03,743 INFO L87 Difference]: Start difference. First operand 4261 states and 6797 transitions. Second operand 7 states. [2019-09-08 04:03:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:08,635 INFO L93 Difference]: Finished difference Result 11799 states and 19263 transitions. [2019-09-08 04:03:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:03:08,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 04:03:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:08,737 INFO L225 Difference]: With dead ends: 11799 [2019-09-08 04:03:08,737 INFO L226 Difference]: Without dead ends: 8363 [2019-09-08 04:03:08,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:03:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2019-09-08 04:03:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 8200. [2019-09-08 04:03:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-09-08 04:03:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 13229 transitions. [2019-09-08 04:03:09,376 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 13229 transitions. Word has length 128 [2019-09-08 04:03:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:09,376 INFO L475 AbstractCegarLoop]: Abstraction has 8200 states and 13229 transitions. [2019-09-08 04:03:09,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 13229 transitions. [2019-09-08 04:03:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:03:09,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:09,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:09,380 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -944417101, now seen corresponding path program 1 times [2019-09-08 04:03:09,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:09,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:03:09,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:03:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:03:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:03:09,507 INFO L87 Difference]: Start difference. First operand 8200 states and 13229 transitions. Second operand 5 states. [2019-09-08 04:03:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:09,845 INFO L93 Difference]: Finished difference Result 15687 states and 25487 transitions. [2019-09-08 04:03:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:09,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-08 04:03:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:09,906 INFO L225 Difference]: With dead ends: 15687 [2019-09-08 04:03:09,907 INFO L226 Difference]: Without dead ends: 8422 [2019-09-08 04:03:09,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:03:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2019-09-08 04:03:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 8290. [2019-09-08 04:03:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-09-08 04:03:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13356 transitions. [2019-09-08 04:03:10,488 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13356 transitions. Word has length 133 [2019-09-08 04:03:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:10,490 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13356 transitions. [2019-09-08 04:03:10,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:03:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13356 transitions. [2019-09-08 04:03:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:03:10,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:10,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:10,493 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1512564016, now seen corresponding path program 1 times [2019-09-08 04:03:10,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:10,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:10,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:10,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:10,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:10,608 INFO L87 Difference]: Start difference. First operand 8290 states and 13356 transitions. Second operand 7 states. [2019-09-08 04:03:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:10,997 INFO L93 Difference]: Finished difference Result 16671 states and 27433 transitions. [2019-09-08 04:03:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:03:10,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-08 04:03:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:11,041 INFO L225 Difference]: With dead ends: 16671 [2019-09-08 04:03:11,042 INFO L226 Difference]: Without dead ends: 8290 [2019-09-08 04:03:11,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:03:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2019-09-08 04:03:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 8290. [2019-09-08 04:03:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2019-09-08 04:03:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 13180 transitions. [2019-09-08 04:03:11,442 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 13180 transitions. Word has length 140 [2019-09-08 04:03:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:11,443 INFO L475 AbstractCegarLoop]: Abstraction has 8290 states and 13180 transitions. [2019-09-08 04:03:11,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 13180 transitions. [2019-09-08 04:03:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:03:11,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:11,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:03:11,447 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash 260228654, now seen corresponding path program 1 times [2019-09-08 04:03:11,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:11,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:11,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:03:12,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:12,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:12,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:12,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:12,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:12,273 INFO L87 Difference]: Start difference. First operand 8290 states and 13180 transitions. Second operand 7 states. [2019-09-08 04:03:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:16,090 INFO L93 Difference]: Finished difference Result 16303 states and 26070 transitions. [2019-09-08 04:03:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:03:16,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-08 04:03:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:16,128 INFO L225 Difference]: With dead ends: 16303 [2019-09-08 04:03:16,128 INFO L226 Difference]: Without dead ends: 8965 [2019-09-08 04:03:16,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:03:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-09-08 04:03:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8754. [2019-09-08 04:03:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8754 states. [2019-09-08 04:03:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 13806 transitions. [2019-09-08 04:03:16,533 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 13806 transitions. Word has length 145 [2019-09-08 04:03:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:16,533 INFO L475 AbstractCegarLoop]: Abstraction has 8754 states and 13806 transitions. [2019-09-08 04:03:16,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 13806 transitions. [2019-09-08 04:03:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:03:16,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:16,537 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:16,537 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -122990279, now seen corresponding path program 1 times [2019-09-08 04:03:16,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:16,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:03:16,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:03:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:03:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:03:16,668 INFO L87 Difference]: Start difference. First operand 8754 states and 13806 transitions. Second operand 6 states. [2019-09-08 04:03:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:17,087 INFO L93 Difference]: Finished difference Result 20227 states and 32274 transitions. [2019-09-08 04:03:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:03:17,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-08 04:03:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:17,145 INFO L225 Difference]: With dead ends: 20227 [2019-09-08 04:03:17,146 INFO L226 Difference]: Without dead ends: 12425 [2019-09-08 04:03:17,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:03:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12425 states. [2019-09-08 04:03:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12425 to 11144. [2019-09-08 04:03:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-08 04:03:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17660 transitions. [2019-09-08 04:03:17,765 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17660 transitions. Word has length 150 [2019-09-08 04:03:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:17,766 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 17660 transitions. [2019-09-08 04:03:17,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:03:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17660 transitions. [2019-09-08 04:03:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 04:03:17,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:17,771 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:17,772 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1772826809, now seen corresponding path program 1 times [2019-09-08 04:03:17,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:17,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:17,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:17,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:03:17,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:03:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:03:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:03:17,975 INFO L87 Difference]: Start difference. First operand 11144 states and 17660 transitions. Second operand 11 states. [2019-09-08 04:03:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:25,225 INFO L93 Difference]: Finished difference Result 24440 states and 38928 transitions. [2019-09-08 04:03:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:03:25,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 04:03:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:25,289 INFO L225 Difference]: With dead ends: 24440 [2019-09-08 04:03:25,289 INFO L226 Difference]: Without dead ends: 14115 [2019-09-08 04:03:25,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:03:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14115 states. [2019-09-08 04:03:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14115 to 13480. [2019-09-08 04:03:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13480 states. [2019-09-08 04:03:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13480 states to 13480 states and 21072 transitions. [2019-09-08 04:03:26,006 INFO L78 Accepts]: Start accepts. Automaton has 13480 states and 21072 transitions. Word has length 152 [2019-09-08 04:03:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:26,006 INFO L475 AbstractCegarLoop]: Abstraction has 13480 states and 21072 transitions. [2019-09-08 04:03:26,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:03:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13480 states and 21072 transitions. [2019-09-08 04:03:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:03:26,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:26,010 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:26,010 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash 578609595, now seen corresponding path program 1 times [2019-09-08 04:03:26,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:26,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:26,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:26,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:26,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:26,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:03:26,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:03:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:03:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:03:26,117 INFO L87 Difference]: Start difference. First operand 13480 states and 21072 transitions. Second operand 4 states. [2019-09-08 04:03:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:28,499 INFO L93 Difference]: Finished difference Result 41996 states and 68364 transitions. [2019-09-08 04:03:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:28,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 04:03:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:28,621 INFO L225 Difference]: With dead ends: 41996 [2019-09-08 04:03:28,621 INFO L226 Difference]: Without dead ends: 28582 [2019-09-08 04:03:28,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:03:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28582 states. [2019-09-08 04:03:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28582 to 28210. [2019-09-08 04:03:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28210 states. [2019-09-08 04:03:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 45535 transitions. [2019-09-08 04:03:31,512 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 45535 transitions. Word has length 150 [2019-09-08 04:03:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:31,512 INFO L475 AbstractCegarLoop]: Abstraction has 28210 states and 45535 transitions. [2019-09-08 04:03:31,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:03:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 45535 transitions. [2019-09-08 04:03:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:03:31,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:31,518 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:31,519 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash 755748053, now seen corresponding path program 1 times [2019-09-08 04:03:31,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:31,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:31,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:03:31,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:03:31,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:03:31,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:03:31,623 INFO L87 Difference]: Start difference. First operand 28210 states and 45535 transitions. Second operand 4 states. [2019-09-08 04:03:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:34,913 INFO L93 Difference]: Finished difference Result 88942 states and 154410 transitions. [2019-09-08 04:03:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:34,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 04:03:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:35,174 INFO L225 Difference]: With dead ends: 88942 [2019-09-08 04:03:35,174 INFO L226 Difference]: Without dead ends: 60798 [2019-09-08 04:03:35,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:03:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60798 states. [2019-09-08 04:03:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60798 to 59951. [2019-09-08 04:03:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-09-08 04:03:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 102549 transitions. [2019-09-08 04:03:39,924 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 102549 transitions. Word has length 151 [2019-09-08 04:03:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:39,924 INFO L475 AbstractCegarLoop]: Abstraction has 59951 states and 102549 transitions. [2019-09-08 04:03:39,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:03:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 102549 transitions. [2019-09-08 04:03:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:03:39,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:39,929 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:03:39,929 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1812499816, now seen corresponding path program 1 times [2019-09-08 04:03:39,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:39,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:40,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:03:40,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:03:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:03:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:03:40,045 INFO L87 Difference]: Start difference. First operand 59951 states and 102549 transitions. Second operand 4 states. [2019-09-08 04:03:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:48,138 INFO L93 Difference]: Finished difference Result 191617 states and 371956 transitions. [2019-09-08 04:03:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:48,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 04:03:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:48,884 INFO L225 Difference]: With dead ends: 191617 [2019-09-08 04:03:48,884 INFO L226 Difference]: Without dead ends: 131732 [2019-09-08 04:03:49,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:03:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131732 states. [2019-09-08 04:03:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131732 to 129728. [2019-09-08 04:03:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129728 states. [2019-09-08 04:03:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129728 states to 129728 states and 245124 transitions. [2019-09-08 04:03:58,797 INFO L78 Accepts]: Start accepts. Automaton has 129728 states and 245124 transitions. Word has length 154 [2019-09-08 04:03:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:58,797 INFO L475 AbstractCegarLoop]: Abstraction has 129728 states and 245124 transitions. [2019-09-08 04:03:58,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:03:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 129728 states and 245124 transitions. [2019-09-08 04:03:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:03:58,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:58,801 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:03:58,801 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash 383568151, now seen corresponding path program 1 times [2019-09-08 04:03:58,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:03:58,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:03:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:03:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:03:58,906 INFO L87 Difference]: Start difference. First operand 129728 states and 245124 transitions. Second operand 4 states. [2019-09-08 04:04:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:04:16,363 INFO L93 Difference]: Finished difference Result 421340 states and 982259 transitions. [2019-09-08 04:04:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:04:16,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 04:04:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:04:25,483 INFO L225 Difference]: With dead ends: 421340 [2019-09-08 04:04:25,483 INFO L226 Difference]: Without dead ends: 291678 [2019-09-08 04:04:25,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:04:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291678 states. [2019-09-08 04:04:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291678 to 286737. [2019-09-08 04:04:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286737 states. [2019-09-08 04:04:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286737 states to 286737 states and 637135 transitions. [2019-09-08 04:04:51,031 INFO L78 Accepts]: Start accepts. Automaton has 286737 states and 637135 transitions. Word has length 153 [2019-09-08 04:04:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:04:51,032 INFO L475 AbstractCegarLoop]: Abstraction has 286737 states and 637135 transitions. [2019-09-08 04:04:51,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:04:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 286737 states and 637135 transitions. [2019-09-08 04:04:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 04:04:51,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:04:51,038 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:04:51,038 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:04:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:04:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1985111766, now seen corresponding path program 1 times [2019-09-08 04:04:51,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:04:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:04:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:04:51,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:04:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:04:51,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:04:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:04:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:04:51,153 INFO L87 Difference]: Start difference. First operand 286737 states and 637135 transitions. Second operand 4 states. [2019-09-08 04:06:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:07,707 INFO L93 Difference]: Finished difference Result 948473 states and 2922217 transitions. [2019-09-08 04:06:07,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:06:07,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 04:06:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:15,919 INFO L225 Difference]: With dead ends: 948473 [2019-09-08 04:06:15,919 INFO L226 Difference]: Without dead ends: 661790 [2019-09-08 04:06:31,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:06:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661790 states.