java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:56:57,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:56:57,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:56:57,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:56:57,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:56:57,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:56:57,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:56:57,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:56:57,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:56:57,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:56:57,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:56:57,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:56:57,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:56:57,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:56:57,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:56:57,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:56:57,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:56:57,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:56:57,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:56:57,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:56:57,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:56:57,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:56:57,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:56:57,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:56:57,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:56:57,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:56:57,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:56:57,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:56:57,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:56:57,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:56:57,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:56:57,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:56:57,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:56:57,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:56:57,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:56:57,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:56:57,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:56:57,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:56:57,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:56:57,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:56:57,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:56:57,244 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-10-02 11:56:57,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:56:57,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:56:57,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:56:57,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:56:57,268 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:56:57,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:56:57,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:56:57,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:56:57,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:56:57,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:56:57,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:56:57,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:56:57,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:56:57,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:56:57,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:56:57,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:56:57,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:56:57,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:56:57,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:56:57,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:56:57,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:56:57,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:56:57,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:56:57,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:56:57,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:56:57,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:56:57,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:56:57,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:56:57,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:56:57,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:56:57,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:56:57,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:56:57,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:56:57,325 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:56:57,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-02 11:56:57,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cf6e984/1daa2be21b78435e916038409a62e6cc/FLAG6fc29e6e6 [2019-10-02 11:56:58,020 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:56:58,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_productSimulator.cil.c [2019-10-02 11:56:58,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cf6e984/1daa2be21b78435e916038409a62e6cc/FLAG6fc29e6e6 [2019-10-02 11:56:58,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cf6e984/1daa2be21b78435e916038409a62e6cc [2019-10-02 11:56:58,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:56:58,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:56:58,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:56:58,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:56:58,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:56:58,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:56:58" (1/1) ... [2019-10-02 11:56:58,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14543c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:58, skipping insertion in model container [2019-10-02 11:56:58,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:56:58" (1/1) ... [2019-10-02 11:56:58,226 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:56:58,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:56:59,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:56:59,138 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:56:59,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:56:59,417 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:56:59,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59 WrapperNode [2019-10-02 11:56:59,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:56:59,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:56:59,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:56:59,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:56:59,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (1/1) ... [2019-10-02 11:56:59,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:56:59,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:56:59,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:56:59,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:56:59,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (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-10-02 11:56:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:56:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:56:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:56:59,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:56:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:56:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:56:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:56:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:56:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:56:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:56:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:56:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:56:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:56:59,720 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:56:59,721 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:56:59,721 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:56:59,721 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:56:59,721 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:56:59,721 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:56:59,722 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:56:59,722 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:56:59,723 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:56:59,723 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:56:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:56:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:56:59,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-02 11:56:59,727 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:56:59,728 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:56:59,729 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:56:59,729 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:56:59,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:56:59,729 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 11:56:59,730 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:56:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:56:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:56:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 11:56:59,731 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 11:56:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 11:56:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 11:56:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:56:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:56:59,733 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:56:59,733 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-02 11:56:59,733 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-02 11:56:59,733 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:56:59,734 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-02 11:56:59,734 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-02 11:56:59,734 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:56:59,734 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:56:59,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:56:59,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:56:59,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:56:59,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:56:59,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:56:59,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:56:59,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:56:59,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:56:59,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:56:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:56:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:56:59,738 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:56:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:56:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:56:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:56:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:56:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:56:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:56:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:56:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:56:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:56:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:56:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:56:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:56:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:56:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:56:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:56:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:56:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:56:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:56:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:56:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:56:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:56:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:56:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:56:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:56:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:56:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:56:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:56:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:56:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:56:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:56:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:56:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:56:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-02 11:56:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:56:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 11:56:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 11:56:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 11:56:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 11:56:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:56:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:56:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 11:56:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 11:56:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 11:56:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-02 11:56:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:56:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:56:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:56:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:56:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:56:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:56:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:56:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:56:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:56:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:56:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:57:01,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:57:01,979 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:57:01,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:01 BoogieIcfgContainer [2019-10-02 11:57:01,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:57:01,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:57:01,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:57:01,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:57:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:56:58" (1/3) ... [2019-10-02 11:57:01,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70455857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:57:01, skipping insertion in model container [2019-10-02 11:57:01,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:56:59" (2/3) ... [2019-10-02 11:57:01,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70455857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:57:01, skipping insertion in model container [2019-10-02 11:57:01,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:01" (3/3) ... [2019-10-02 11:57:01,991 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_productSimulator.cil.c [2019-10-02 11:57:02,001 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:57:02,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:57:02,030 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:57:02,078 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:57:02,079 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:57:02,079 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:57:02,079 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:57:02,079 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:57:02,079 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:57:02,079 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:57:02,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:57:02,080 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:57:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2019-10-02 11:57:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 11:57:02,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:02,160 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:02,163 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2107990238, now seen corresponding path program 1 times [2019-10-02 11:57:02,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:02,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:02,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:02,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:02,880 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 6 states. [2019-10-02 11:57:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:03,114 INFO L93 Difference]: Finished difference Result 1446 states and 2245 transitions. [2019-10-02 11:57:03,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:03,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 11:57:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:03,151 INFO L225 Difference]: With dead ends: 1446 [2019-10-02 11:57:03,152 INFO L226 Difference]: Without dead ends: 726 [2019-10-02 11:57:03,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-02 11:57:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-10-02 11:57:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-02 11:57:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1115 transitions. [2019-10-02 11:57:03,304 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1115 transitions. Word has length 120 [2019-10-02 11:57:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:03,312 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1115 transitions. [2019-10-02 11:57:03,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1115 transitions. [2019-10-02 11:57:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 11:57:03,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:03,320 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:03,320 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2135919125, now seen corresponding path program 1 times [2019-10-02 11:57:03,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:03,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:03,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:03,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:03,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:03,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:03,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:03,621 INFO L87 Difference]: Start difference. First operand 726 states and 1115 transitions. Second operand 4 states. [2019-10-02 11:57:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:03,774 INFO L93 Difference]: Finished difference Result 1410 states and 2184 transitions. [2019-10-02 11:57:03,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:03,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-02 11:57:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:03,782 INFO L225 Difference]: With dead ends: 1410 [2019-10-02 11:57:03,782 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:57:03,786 INFO L640 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-10-02 11:57:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:57:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-02 11:57:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:57:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1118 transitions. [2019-10-02 11:57:03,820 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1118 transitions. Word has length 121 [2019-10-02 11:57:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:03,821 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1118 transitions. [2019-10-02 11:57:03,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1118 transitions. [2019-10-02 11:57:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 11:57:03,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:03,824 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:03,824 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash -542373665, now seen corresponding path program 1 times [2019-10-02 11:57:03,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:03,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:04,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:04,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:04,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:04,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:04,005 INFO L87 Difference]: Start difference. First operand 730 states and 1118 transitions. Second operand 4 states. [2019-10-02 11:57:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:04,101 INFO L93 Difference]: Finished difference Result 1407 states and 2171 transitions. [2019-10-02 11:57:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:04,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-02 11:57:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:04,109 INFO L225 Difference]: With dead ends: 1407 [2019-10-02 11:57:04,109 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:57:04,113 INFO L640 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-10-02 11:57:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:57:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-02 11:57:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:57:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1117 transitions. [2019-10-02 11:57:04,141 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1117 transitions. Word has length 122 [2019-10-02 11:57:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:04,142 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1117 transitions. [2019-10-02 11:57:04,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1117 transitions. [2019-10-02 11:57:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 11:57:04,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:04,145 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:04,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2073857327, now seen corresponding path program 1 times [2019-10-02 11:57:04,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:04,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:04,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:04,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:04,311 INFO L87 Difference]: Start difference. First operand 730 states and 1117 transitions. Second operand 4 states. [2019-10-02 11:57:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:04,387 INFO L93 Difference]: Finished difference Result 1407 states and 2170 transitions. [2019-10-02 11:57:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:04,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-02 11:57:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:04,394 INFO L225 Difference]: With dead ends: 1407 [2019-10-02 11:57:04,394 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:57:04,400 INFO L640 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-10-02 11:57:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:57:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-02 11:57:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:57:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1116 transitions. [2019-10-02 11:57:04,431 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1116 transitions. Word has length 123 [2019-10-02 11:57:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:04,431 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1116 transitions. [2019-10-02 11:57:04,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1116 transitions. [2019-10-02 11:57:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:57:04,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:04,437 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:04,438 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1880970907, now seen corresponding path program 1 times [2019-10-02 11:57:04,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:04,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:04,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:04,637 INFO L87 Difference]: Start difference. First operand 730 states and 1116 transitions. Second operand 4 states. [2019-10-02 11:57:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:04,705 INFO L93 Difference]: Finished difference Result 1407 states and 2169 transitions. [2019-10-02 11:57:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:04,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-02 11:57:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:04,718 INFO L225 Difference]: With dead ends: 1407 [2019-10-02 11:57:04,718 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:57:04,724 INFO L640 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-10-02 11:57:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:57:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-02 11:57:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:57:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1115 transitions. [2019-10-02 11:57:04,755 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1115 transitions. Word has length 124 [2019-10-02 11:57:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:04,757 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1115 transitions. [2019-10-02 11:57:04,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1115 transitions. [2019-10-02 11:57:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:57:04,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:04,761 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:04,761 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -182191219, now seen corresponding path program 1 times [2019-10-02 11:57:04,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:04,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:04,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:04,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:04,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:04,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:04,881 INFO L87 Difference]: Start difference. First operand 730 states and 1115 transitions. Second operand 4 states. [2019-10-02 11:57:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:04,958 INFO L93 Difference]: Finished difference Result 1407 states and 2168 transitions. [2019-10-02 11:57:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:04,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-02 11:57:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:04,969 INFO L225 Difference]: With dead ends: 1407 [2019-10-02 11:57:04,969 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:57:04,975 INFO L640 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-10-02 11:57:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:57:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2019-10-02 11:57:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-10-02 11:57:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1114 transitions. [2019-10-02 11:57:05,015 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1114 transitions. Word has length 125 [2019-10-02 11:57:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:05,016 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1114 transitions. [2019-10-02 11:57:05,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1114 transitions. [2019-10-02 11:57:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:57:05,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:05,021 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:05,021 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash 175506519, now seen corresponding path program 1 times [2019-10-02 11:57:05,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:05,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:05,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:05,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:05,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:05,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:57:05,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:57:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:57:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:05,340 INFO L87 Difference]: Start difference. First operand 730 states and 1114 transitions. Second operand 11 states. [2019-10-02 11:57:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:05,725 INFO L93 Difference]: Finished difference Result 1412 states and 2175 transitions. [2019-10-02 11:57:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:57:05,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-10-02 11:57:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:05,732 INFO L225 Difference]: With dead ends: 1412 [2019-10-02 11:57:05,733 INFO L226 Difference]: Without dead ends: 739 [2019-10-02 11:57:05,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-02 11:57:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2019-10-02 11:57:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-02 11:57:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1124 transitions. [2019-10-02 11:57:05,766 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1124 transitions. Word has length 126 [2019-10-02 11:57:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:05,767 INFO L475 AbstractCegarLoop]: Abstraction has 737 states and 1124 transitions. [2019-10-02 11:57:05,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:57:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1124 transitions. [2019-10-02 11:57:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 11:57:05,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:05,769 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:05,770 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1999173578, now seen corresponding path program 1 times [2019-10-02 11:57:05,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:05,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:05,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:05,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:05,901 INFO L87 Difference]: Start difference. First operand 737 states and 1124 transitions. Second operand 4 states. [2019-10-02 11:57:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:05,967 INFO L93 Difference]: Finished difference Result 1413 states and 2176 transitions. [2019-10-02 11:57:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:05,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-02 11:57:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:05,974 INFO L225 Difference]: With dead ends: 1413 [2019-10-02 11:57:05,974 INFO L226 Difference]: Without dead ends: 733 [2019-10-02 11:57:05,978 INFO L640 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-10-02 11:57:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-02 11:57:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-10-02 11:57:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-02 11:57:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1117 transitions. [2019-10-02 11:57:06,011 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1117 transitions. Word has length 126 [2019-10-02 11:57:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:06,012 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1117 transitions. [2019-10-02 11:57:06,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1117 transitions. [2019-10-02 11:57:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 11:57:06,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:06,015 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:06,015 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1624055113, now seen corresponding path program 1 times [2019-10-02 11:57:06,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:06,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:06,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:06,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:06,155 INFO L87 Difference]: Start difference. First operand 733 states and 1117 transitions. Second operand 6 states. [2019-10-02 11:57:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:06,427 INFO L93 Difference]: Finished difference Result 1426 states and 2200 transitions. [2019-10-02 11:57:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:06,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-10-02 11:57:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:06,434 INFO L225 Difference]: With dead ends: 1426 [2019-10-02 11:57:06,434 INFO L226 Difference]: Without dead ends: 741 [2019-10-02 11:57:06,438 INFO L640 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-10-02 11:57:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-02 11:57:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 738. [2019-10-02 11:57:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-02 11:57:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-10-02 11:57:06,468 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 127 [2019-10-02 11:57:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:06,468 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-10-02 11:57:06,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-10-02 11:57:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 11:57:06,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:06,471 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:06,472 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1494752762, now seen corresponding path program 1 times [2019-10-02 11:57:06,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:06,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:06,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:06,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:06,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:06,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:06,670 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 6 states. [2019-10-02 11:57:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:06,938 INFO L93 Difference]: Finished difference Result 1389 states and 2115 transitions. [2019-10-02 11:57:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:06,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-02 11:57:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:06,945 INFO L225 Difference]: With dead ends: 1389 [2019-10-02 11:57:06,945 INFO L226 Difference]: Without dead ends: 738 [2019-10-02 11:57:06,949 INFO L640 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-10-02 11:57:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-02 11:57:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-02 11:57:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-02 11:57:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1114 transitions. [2019-10-02 11:57:06,981 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1114 transitions. Word has length 128 [2019-10-02 11:57:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:06,982 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1114 transitions. [2019-10-02 11:57:06,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1114 transitions. [2019-10-02 11:57:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:57:06,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:06,985 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:06,985 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 638673006, now seen corresponding path program 1 times [2019-10-02 11:57:06,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:06,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:07,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:07,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:07,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:07,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:07,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:07,121 INFO L87 Difference]: Start difference. First operand 738 states and 1114 transitions. Second operand 6 states. [2019-10-02 11:57:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:07,330 INFO L93 Difference]: Finished difference Result 1389 states and 2111 transitions. [2019-10-02 11:57:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:07,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 11:57:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:07,337 INFO L225 Difference]: With dead ends: 1389 [2019-10-02 11:57:07,337 INFO L226 Difference]: Without dead ends: 738 [2019-10-02 11:57:07,342 INFO L640 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-10-02 11:57:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-02 11:57:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-10-02 11:57:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-02 11:57:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1110 transitions. [2019-10-02 11:57:07,368 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1110 transitions. Word has length 129 [2019-10-02 11:57:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:07,370 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1110 transitions. [2019-10-02 11:57:07,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1110 transitions. [2019-10-02 11:57:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:57:07,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:07,372 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:07,372 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:07,373 INFO L82 PathProgramCache]: Analyzing trace with hash 805428462, now seen corresponding path program 1 times [2019-10-02 11:57:07,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:07,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:07,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:07,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:07,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:07,505 INFO L87 Difference]: Start difference. First operand 738 states and 1110 transitions. Second operand 7 states. [2019-10-02 11:57:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:07,628 INFO L93 Difference]: Finished difference Result 1392 states and 2111 transitions. [2019-10-02 11:57:07,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:07,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-02 11:57:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:07,635 INFO L225 Difference]: With dead ends: 1392 [2019-10-02 11:57:07,635 INFO L226 Difference]: Without dead ends: 720 [2019-10-02 11:57:07,639 INFO L640 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-10-02 11:57:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-10-02 11:57:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 717. [2019-10-02 11:57:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 11:57:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1073 transitions. [2019-10-02 11:57:07,663 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1073 transitions. Word has length 129 [2019-10-02 11:57:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:07,663 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1073 transitions. [2019-10-02 11:57:07,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1073 transitions. [2019-10-02 11:57:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 11:57:07,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:07,667 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:07,667 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1272669825, now seen corresponding path program 1 times [2019-10-02 11:57:07,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:07,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:07,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:07,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:07,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:07,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:07,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:07,809 INFO L87 Difference]: Start difference. First operand 717 states and 1073 transitions. Second operand 6 states. [2019-10-02 11:57:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:07,933 INFO L93 Difference]: Finished difference Result 1368 states and 2070 transitions. [2019-10-02 11:57:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:07,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-02 11:57:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:07,939 INFO L225 Difference]: With dead ends: 1368 [2019-10-02 11:57:07,939 INFO L226 Difference]: Without dead ends: 717 [2019-10-02 11:57:07,943 INFO L640 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-10-02 11:57:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-02 11:57:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-02 11:57:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 11:57:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-10-02 11:57:07,966 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 130 [2019-10-02 11:57:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:07,967 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-10-02 11:57:07,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-10-02 11:57:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 11:57:07,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:07,969 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:07,970 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1537429613, now seen corresponding path program 1 times [2019-10-02 11:57:07,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:07,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:07,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:08,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:08,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:57:08,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:08,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:08,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:08,113 INFO L87 Difference]: Start difference. First operand 717 states and 1072 transitions. Second operand 6 states. [2019-10-02 11:57:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:08,242 INFO L93 Difference]: Finished difference Result 1368 states and 2069 transitions. [2019-10-02 11:57:08,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:08,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-02 11:57:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:08,248 INFO L225 Difference]: With dead ends: 1368 [2019-10-02 11:57:08,248 INFO L226 Difference]: Without dead ends: 717 [2019-10-02 11:57:08,253 INFO L640 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-10-02 11:57:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-02 11:57:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-02 11:57:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 11:57:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1071 transitions. [2019-10-02 11:57:08,275 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1071 transitions. Word has length 131 [2019-10-02 11:57:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:08,278 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1071 transitions. [2019-10-02 11:57:08,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1071 transitions. [2019-10-02 11:57:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 11:57:08,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:08,280 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:08,280 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1036805370, now seen corresponding path program 1 times [2019-10-02 11:57:08,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:08,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:08,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:08,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:57:08,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:08,390 INFO L87 Difference]: Start difference. First operand 717 states and 1071 transitions. Second operand 4 states. [2019-10-02 11:57:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:08,467 INFO L93 Difference]: Finished difference Result 1368 states and 2068 transitions. [2019-10-02 11:57:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:08,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-02 11:57:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:08,474 INFO L225 Difference]: With dead ends: 1368 [2019-10-02 11:57:08,474 INFO L226 Difference]: Without dead ends: 717 [2019-10-02 11:57:08,481 INFO L640 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-10-02 11:57:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-02 11:57:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-02 11:57:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 11:57:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-10-02 11:57:08,513 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 132 [2019-10-02 11:57:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:08,514 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-10-02 11:57:08,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-10-02 11:57:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 11:57:08,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:08,517 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:08,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1997244676, now seen corresponding path program 1 times [2019-10-02 11:57:08,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:08,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:08,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:08,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:57:08,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:57:08,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:57:08,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:08,754 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 13 states. [2019-10-02 11:57:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:09,063 INFO L93 Difference]: Finished difference Result 1374 states and 2078 transitions. [2019-10-02 11:57:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:57:09,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-10-02 11:57:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:09,071 INFO L225 Difference]: With dead ends: 1374 [2019-10-02 11:57:09,071 INFO L226 Difference]: Without dead ends: 724 [2019-10-02 11:57:09,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:57:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-02 11:57:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2019-10-02 11:57:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-02 11:57:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1076 transitions. [2019-10-02 11:57:09,103 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1076 transitions. Word has length 132 [2019-10-02 11:57:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:09,104 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 1076 transitions. [2019-10-02 11:57:09,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:57:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1076 transitions. [2019-10-02 11:57:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 11:57:09,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:09,111 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:09,111 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2064235796, now seen corresponding path program 1 times [2019-10-02 11:57:09,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:09,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:09,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:09,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:57:09,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:57:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:57:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:57:09,235 INFO L87 Difference]: Start difference. First operand 722 states and 1076 transitions. Second operand 3 states. [2019-10-02 11:57:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:09,305 INFO L93 Difference]: Finished difference Result 2040 states and 3094 transitions. [2019-10-02 11:57:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:57:09,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-02 11:57:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:09,315 INFO L225 Difference]: With dead ends: 2040 [2019-10-02 11:57:09,315 INFO L226 Difference]: Without dead ends: 1391 [2019-10-02 11:57:09,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:57:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-10-02 11:57:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1388. [2019-10-02 11:57:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-02 11:57:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2089 transitions. [2019-10-02 11:57:09,375 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2089 transitions. Word has length 133 [2019-10-02 11:57:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:09,376 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2089 transitions. [2019-10-02 11:57:09,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:57:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2089 transitions. [2019-10-02 11:57:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 11:57:09,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:09,379 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 11:57:09,379 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 565322765, now seen corresponding path program 1 times [2019-10-02 11:57:09,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:09,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:09,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:09,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:57:09,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:09,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:57:09,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:57:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:57:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:57:09,535 INFO L87 Difference]: Start difference. First operand 1388 states and 2089 transitions. Second operand 5 states. [2019-10-02 11:57:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:13,100 INFO L93 Difference]: Finished difference Result 4171 states and 6512 transitions. [2019-10-02 11:57:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:13,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-10-02 11:57:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:13,121 INFO L225 Difference]: With dead ends: 4171 [2019-10-02 11:57:13,122 INFO L226 Difference]: Without dead ends: 2900 [2019-10-02 11:57:13,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-10-02 11:57:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2797. [2019-10-02 11:57:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-10-02 11:57:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4393 transitions. [2019-10-02 11:57:13,271 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4393 transitions. Word has length 134 [2019-10-02 11:57:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:13,271 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4393 transitions. [2019-10-02 11:57:13,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:57:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4393 transitions. [2019-10-02 11:57:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 11:57:13,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:13,284 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:13,285 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1531506531, now seen corresponding path program 1 times [2019-10-02 11:57:13,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:13,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:13,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:13,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:57:13,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:13,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:57:13,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:57:13,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:57:13,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:57:13,441 INFO L87 Difference]: Start difference. First operand 2797 states and 4393 transitions. Second operand 3 states. [2019-10-02 11:57:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:13,650 INFO L93 Difference]: Finished difference Result 4132 states and 6497 transitions. [2019-10-02 11:57:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:57:13,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 11:57:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:13,672 INFO L225 Difference]: With dead ends: 4132 [2019-10-02 11:57:13,672 INFO L226 Difference]: Without dead ends: 2800 [2019-10-02 11:57:13,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:57:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-02 11:57:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2797. [2019-10-02 11:57:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-10-02 11:57:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4367 transitions. [2019-10-02 11:57:13,810 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4367 transitions. Word has length 180 [2019-10-02 11:57:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:13,811 INFO L475 AbstractCegarLoop]: Abstraction has 2797 states and 4367 transitions. [2019-10-02 11:57:13,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:57:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4367 transitions. [2019-10-02 11:57:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 11:57:13,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:13,820 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:13,821 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1763835588, now seen corresponding path program 1 times [2019-10-02 11:57:13,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:13,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:57:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:14,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:14,033 INFO L87 Difference]: Start difference. First operand 2797 states and 4367 transitions. Second operand 9 states. [2019-10-02 11:57:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:15,418 INFO L93 Difference]: Finished difference Result 5465 states and 8645 transitions. [2019-10-02 11:57:15,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:15,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-02 11:57:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:15,437 INFO L225 Difference]: With dead ends: 5465 [2019-10-02 11:57:15,438 INFO L226 Difference]: Without dead ends: 2784 [2019-10-02 11:57:15,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-10-02 11:57:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2019-10-02 11:57:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-10-02 11:57:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4337 transitions. [2019-10-02 11:57:15,575 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4337 transitions. Word has length 179 [2019-10-02 11:57:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:15,576 INFO L475 AbstractCegarLoop]: Abstraction has 2784 states and 4337 transitions. [2019-10-02 11:57:15,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4337 transitions. [2019-10-02 11:57:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 11:57:15,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:15,587 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:57:15,587 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -485595940, now seen corresponding path program 1 times [2019-10-02 11:57:15,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:15,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:15,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:15,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:57:15,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:15,812 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:15,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:16,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:57:16,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:57:16,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:16,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:57:16,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:16,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:16,689 INFO L87 Difference]: Start difference. First operand 2784 states and 4337 transitions. Second operand 9 states. [2019-10-02 11:57:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:18,365 INFO L93 Difference]: Finished difference Result 5465 states and 8747 transitions. [2019-10-02 11:57:18,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:18,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-10-02 11:57:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:18,396 INFO L225 Difference]: With dead ends: 5465 [2019-10-02 11:57:18,396 INFO L226 Difference]: Without dead ends: 2800 [2019-10-02 11:57:18,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-02 11:57:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2800. [2019-10-02 11:57:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2019-10-02 11:57:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4353 transitions. [2019-10-02 11:57:18,607 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4353 transitions. Word has length 193 [2019-10-02 11:57:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:18,608 INFO L475 AbstractCegarLoop]: Abstraction has 2800 states and 4353 transitions. [2019-10-02 11:57:18,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4353 transitions. [2019-10-02 11:57:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 11:57:18,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:18,622 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:57:18,623 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1227005091, now seen corresponding path program 1 times [2019-10-02 11:57:18,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:18,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:57:18,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:18,872 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:18,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:19,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:57:19,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:57:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:57:19,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:19,508 INFO L87 Difference]: Start difference. First operand 2800 states and 4353 transitions. Second operand 9 states. [2019-10-02 11:57:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:21,052 INFO L93 Difference]: Finished difference Result 5501 states and 8775 transitions. [2019-10-02 11:57:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:21,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-10-02 11:57:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:21,080 INFO L225 Difference]: With dead ends: 5501 [2019-10-02 11:57:21,081 INFO L226 Difference]: Without dead ends: 2820 [2019-10-02 11:57:21,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:57:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-10-02 11:57:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2019-10-02 11:57:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-10-02 11:57:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4373 transitions. [2019-10-02 11:57:21,265 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4373 transitions. Word has length 196 [2019-10-02 11:57:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:21,265 INFO L475 AbstractCegarLoop]: Abstraction has 2820 states and 4373 transitions. [2019-10-02 11:57:21,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4373 transitions. [2019-10-02 11:57:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:57:21,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:21,276 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:57:21,276 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1959931264, now seen corresponding path program 1 times [2019-10-02 11:57:21,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:21,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:21,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:57:21,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:21,414 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:21,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 3116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:57:21,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:57:22,007 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:403) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.exit(Executor.java:135) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.exit(Scriptor.java:213) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.exit(WrapperScript.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 11:57:22,012 INFO L168 Benchmark]: Toolchain (without parser) took 23797.82 ms. Allocated memory was 143.1 MB in the beginning and 692.1 MB in the end (delta: 548.9 MB). Free memory was 86.4 MB in the beginning and 265.9 MB in the end (delta: -179.5 MB). Peak memory consumption was 369.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,013 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1204.70 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 86.2 MB in the beginning and 132.3 MB in the end (delta: -46.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,015 INFO L168 Benchmark]: Boogie Preprocessor took 229.92 ms. Allocated memory is still 202.9 MB. Free memory was 132.3 MB in the beginning and 122.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,015 INFO L168 Benchmark]: RCFGBuilder took 2331.59 ms. Allocated memory was 202.9 MB in the beginning and 259.5 MB in the end (delta: 56.6 MB). Free memory was 122.3 MB in the beginning and 110.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,016 INFO L168 Benchmark]: TraceAbstraction took 20027.59 ms. Allocated memory was 259.5 MB in the beginning and 692.1 MB in the end (delta: 432.5 MB). Free memory was 110.8 MB in the beginning and 265.9 MB in the end (delta: -155.1 MB). Peak memory consumption was 277.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:57:22,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1204.70 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 86.2 MB in the beginning and 132.3 MB in the end (delta: -46.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 229.92 ms. Allocated memory is still 202.9 MB. Free memory was 132.3 MB in the beginning and 122.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2331.59 ms. Allocated memory was 202.9 MB in the beginning and 259.5 MB in the end (delta: 56.6 MB). Free memory was 122.3 MB in the beginning and 110.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20027.59 ms. Allocated memory was 259.5 MB in the beginning and 692.1 MB in the end (delta: 432.5 MB). Free memory was 110.8 MB in the beginning and 265.9 MB in the end (delta: -155.1 MB). Peak memory consumption was 277.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:403) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...