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_spec3_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:10:45,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:10:45,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:10:45,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:10:45,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:10:45,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:10:45,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:10:45,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:10:45,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:10:45,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:10:45,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:10:45,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:10:45,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:10:45,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:10:45,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:10:45,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:10:45,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:10:45,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:10:45,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:10:45,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:10:45,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:10:45,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:10:45,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:10:45,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:10:45,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:10:45,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:10:45,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:10:45,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:10:45,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:10:45,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:10:45,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:10:45,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:10:45,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:10:45,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:10:45,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:10:45,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:10:45,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:10:45,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:10:45,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:10:45,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:10:45,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:10:45,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:10:45,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:10:45,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:10:45,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:10:45,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:10:45,246 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:10:45,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:10:45,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:10:45,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:10:45,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:10:45,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:10:45,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:10:45,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:10:45,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:10:45,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:10:45,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:10:45,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:10:45,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:10:45,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:10:45,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:10:45,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:10:45,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:10:45,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:10:45,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:10:45,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:10:45,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:10:45,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:10:45,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:10:45,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:10:45,298 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:10:45,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-09-08 04:10:45,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e01867f/8a857decad884842b49846f5ab3f8e69/FLAG1b1cc159f [2019-09-08 04:10:45,978 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:10:45,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-09-08 04:10:46,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e01867f/8a857decad884842b49846f5ab3f8e69/FLAG1b1cc159f [2019-09-08 04:10:46,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e01867f/8a857decad884842b49846f5ab3f8e69 [2019-09-08 04:10:46,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:10:46,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:10:46,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:10:46,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:10:46,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:10:46,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:10:46" (1/1) ... [2019-09-08 04:10:46,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a23211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:46, skipping insertion in model container [2019-09-08 04:10:46,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:10:46" (1/1) ... [2019-09-08 04:10:46,226 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:10:46,303 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:10:47,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:10:47,066 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:10:47,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:10:47,297 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:10:47,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47 WrapperNode [2019-09-08 04:10:47,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:10:47,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:10:47,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:10:47,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:10:47,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... [2019-09-08 04:10:47,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:10:47,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:10:47,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:10:47,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:10:47,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:10:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:10:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:10:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:10:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:10:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:10:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:10:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:10:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:10:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:10:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:10:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:10:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:10:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:10:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:10:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:10:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:10:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:10:47,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:10:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:10:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:10:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:10:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:10:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:10:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:10:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:10:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:10:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:10:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:10:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:10:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:10:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:10:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:10:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:10:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:10:47,554 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:10:47,555 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:10:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:10:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:10:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:10:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:10:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:10:47,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:10:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:10:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:10:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:10:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:10:47,558 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:10:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:10:47,559 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:10:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:10:47,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:10:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:10:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:10:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:10:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:10:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:10:47,561 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:10:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:10:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:10:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:10:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:10:47,562 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:10:47,563 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:10:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:10:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:10:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:10:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:10:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:10:47,565 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:10:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:10:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:10:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:10:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:10:47,566 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:10:47,567 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:10:47,568 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:10:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:10:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:10:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:10:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:10:47,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:10:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:10:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:10:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:10:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:10:47,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:10:47,571 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:10:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:10:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:10:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:10:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:10:47,572 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:10:47,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:10:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:10:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:10:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:10:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:10:47,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:10:47,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:10:49,848 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:10:49,848 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:10:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:10:49 BoogieIcfgContainer [2019-09-08 04:10:49,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:10:49,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:10:49,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:10:49,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:10:49,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:10:46" (1/3) ... [2019-09-08 04:10:49,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:10:49, skipping insertion in model container [2019-09-08 04:10:49,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:10:47" (2/3) ... [2019-09-08 04:10:49,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:10:49, skipping insertion in model container [2019-09-08 04:10:49,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:10:49" (3/3) ... [2019-09-08 04:10:49,858 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product01.cil.c [2019-09-08 04:10:49,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:10:49,879 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:10:49,896 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:10:49,938 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:10:49,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:10:49,939 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:10:49,939 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:10:49,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:10:49,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:10:49,940 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:10:49,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:10:49,940 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:10:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-08 04:10:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 04:10:50,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:50,020 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:50,025 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1682345477, now seen corresponding path program 1 times [2019-09-08 04:10:50,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:50,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:50,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:50,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:50,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:10:50,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:10:50,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:10:50,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:10:50,701 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 7 states. [2019-09-08 04:10:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:50,999 INFO L93 Difference]: Finished difference Result 1161 states and 1906 transitions. [2019-09-08 04:10:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:51,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-09-08 04:10:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:51,043 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:10:51,043 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:10:51,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:10:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-08 04:10:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 04:10:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 948 transitions. [2019-09-08 04:10:51,207 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 948 transitions. Word has length 115 [2019-09-08 04:10:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:51,208 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 948 transitions. [2019-09-08 04:10:51,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:10:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 948 transitions. [2019-09-08 04:10:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:10:51,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:51,216 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:51,217 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:51,218 INFO L82 PathProgramCache]: Analyzing trace with hash 492962916, now seen corresponding path program 1 times [2019-09-08 04:10:51,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:51,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:51,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:10:51,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:10:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:10:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:10:51,500 INFO L87 Difference]: Start difference. First operand 587 states and 948 transitions. Second operand 4 states. [2019-09-08 04:10:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:51,587 INFO L93 Difference]: Finished difference Result 1140 states and 1861 transitions. [2019-09-08 04:10:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:10:51,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 04:10:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:51,594 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 04:10:51,595 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 04:10:51,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:10:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 04:10:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-09-08 04:10:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-08 04:10:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 915 transitions. [2019-09-08 04:10:51,640 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 915 transitions. Word has length 116 [2019-09-08 04:10:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:51,643 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 915 transitions. [2019-09-08 04:10:51,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:10:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 915 transitions. [2019-09-08 04:10:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:10:51,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:51,650 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:51,651 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1591926986, now seen corresponding path program 1 times [2019-09-08 04:10:51,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:51,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:51,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:51,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:10:51,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:10:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:10:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:10:51,855 INFO L87 Difference]: Start difference. First operand 569 states and 915 transitions. Second operand 7 states. [2019-09-08 04:10:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:51,959 INFO L93 Difference]: Finished difference Result 1109 states and 1803 transitions. [2019-09-08 04:10:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:51,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-09-08 04:10:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:51,965 INFO L225 Difference]: With dead ends: 1109 [2019-09-08 04:10:51,965 INFO L226 Difference]: Without dead ends: 563 [2019-09-08 04:10:51,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-08 04:10:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-09-08 04:10:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 04:10:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 902 transitions. [2019-09-08 04:10:51,991 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 902 transitions. Word has length 116 [2019-09-08 04:10:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:51,991 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 902 transitions. [2019-09-08 04:10:51,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:10:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 902 transitions. [2019-09-08 04:10:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 04:10:51,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:51,995 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:51,995 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1250073911, now seen corresponding path program 1 times [2019-09-08 04:10:51,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:51,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:51,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:52,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:52,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:10:52,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:10:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:10:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:10:52,180 INFO L87 Difference]: Start difference. First operand 563 states and 902 transitions. Second operand 7 states. [2019-09-08 04:10:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:52,284 INFO L93 Difference]: Finished difference Result 1097 states and 1777 transitions. [2019-09-08 04:10:52,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:52,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 04:10:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:52,294 INFO L225 Difference]: With dead ends: 1097 [2019-09-08 04:10:52,294 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 04:10:52,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 04:10:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-09-08 04:10:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-08 04:10:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 889 transitions. [2019-09-08 04:10:52,326 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 889 transitions. Word has length 117 [2019-09-08 04:10:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:52,326 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 889 transitions. [2019-09-08 04:10:52,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:10:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 889 transitions. [2019-09-08 04:10:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:10:52,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:52,333 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:52,333 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 803183822, now seen corresponding path program 1 times [2019-09-08 04:10:52,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:52,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:52,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:10:52,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:10:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:10:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:10:52,504 INFO L87 Difference]: Start difference. First operand 557 states and 889 transitions. Second operand 7 states. [2019-09-08 04:10:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:52,597 INFO L93 Difference]: Finished difference Result 1085 states and 1751 transitions. [2019-09-08 04:10:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:52,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 04:10:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:52,603 INFO L225 Difference]: With dead ends: 1085 [2019-09-08 04:10:52,603 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:52,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 876 transitions. [2019-09-08 04:10:52,629 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 876 transitions. Word has length 118 [2019-09-08 04:10:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:52,630 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 876 transitions. [2019-09-08 04:10:52,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:10:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 876 transitions. [2019-09-08 04:10:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:10:52,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:52,634 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:52,634 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash -377403377, now seen corresponding path program 1 times [2019-09-08 04:10:52,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:52,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:52,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:52,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:10:52,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:10:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:10:52,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:10:52,854 INFO L87 Difference]: Start difference. First operand 551 states and 876 transitions. Second operand 7 states. [2019-09-08 04:10:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:52,948 INFO L93 Difference]: Finished difference Result 1073 states and 1725 transitions. [2019-09-08 04:10:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:10:52,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 04:10:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:52,960 INFO L225 Difference]: With dead ends: 1073 [2019-09-08 04:10:52,960 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:52,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 875 transitions. [2019-09-08 04:10:52,988 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 875 transitions. Word has length 118 [2019-09-08 04:10:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:52,989 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 875 transitions. [2019-09-08 04:10:52,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:10:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 875 transitions. [2019-09-08 04:10:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 04:10:52,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:52,995 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:52,998 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -9363571, now seen corresponding path program 1 times [2019-09-08 04:10:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:53,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:53,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:10:53,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:10:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:10:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:10:53,145 INFO L87 Difference]: Start difference. First operand 551 states and 875 transitions. Second operand 5 states. [2019-09-08 04:10:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:53,282 INFO L93 Difference]: Finished difference Result 1072 states and 1722 transitions. [2019-09-08 04:10:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:10:53,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-08 04:10:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:53,288 INFO L225 Difference]: With dead ends: 1072 [2019-09-08 04:10:53,288 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:53,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 874 transitions. [2019-09-08 04:10:53,316 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 874 transitions. Word has length 119 [2019-09-08 04:10:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:53,316 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 874 transitions. [2019-09-08 04:10:53,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:10:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 874 transitions. [2019-09-08 04:10:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 04:10:53,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:53,321 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:53,321 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:53,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1274402062, now seen corresponding path program 1 times [2019-09-08 04:10:53,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:53,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:53,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:10:53,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:10:53,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:10:53,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:10:53,477 INFO L87 Difference]: Start difference. First operand 551 states and 874 transitions. Second operand 5 states. [2019-09-08 04:10:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:53,546 INFO L93 Difference]: Finished difference Result 1072 states and 1720 transitions. [2019-09-08 04:10:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:10:53,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 04:10:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:53,553 INFO L225 Difference]: With dead ends: 1072 [2019-09-08 04:10:53,553 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:53,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 873 transitions. [2019-09-08 04:10:53,578 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 873 transitions. Word has length 120 [2019-09-08 04:10:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:53,578 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 873 transitions. [2019-09-08 04:10:53,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:10:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 873 transitions. [2019-09-08 04:10:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 04:10:53,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:53,582 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:53,582 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1402359096, now seen corresponding path program 1 times [2019-09-08 04:10:53,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:53,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:53,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:10:53,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:10:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:10:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:10:53,779 INFO L87 Difference]: Start difference. First operand 551 states and 873 transitions. Second operand 5 states. [2019-09-08 04:10:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:53,843 INFO L93 Difference]: Finished difference Result 1072 states and 1718 transitions. [2019-09-08 04:10:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:10:53,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 04:10:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:53,848 INFO L225 Difference]: With dead ends: 1072 [2019-09-08 04:10:53,848 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:53,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 872 transitions. [2019-09-08 04:10:53,871 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 872 transitions. Word has length 121 [2019-09-08 04:10:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:53,872 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 872 transitions. [2019-09-08 04:10:53,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:10:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 872 transitions. [2019-09-08 04:10:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 04:10:53,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:53,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:53,875 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1993568105, now seen corresponding path program 1 times [2019-09-08 04:10:53,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:53,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:53,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:10:53,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:10:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:10:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:10:53,993 INFO L87 Difference]: Start difference. First operand 551 states and 872 transitions. Second operand 5 states. [2019-09-08 04:10:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:54,052 INFO L93 Difference]: Finished difference Result 1072 states and 1716 transitions. [2019-09-08 04:10:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:10:54,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 04:10:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:54,057 INFO L225 Difference]: With dead ends: 1072 [2019-09-08 04:10:54,058 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 04:10:54,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:10:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 04:10:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 04:10:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 04:10:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 871 transitions. [2019-09-08 04:10:54,082 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 871 transitions. Word has length 122 [2019-09-08 04:10:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:54,082 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 871 transitions. [2019-09-08 04:10:54,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:10:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 871 transitions. [2019-09-08 04:10:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 04:10:54,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:54,086 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:54,086 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash 369306115, now seen corresponding path program 1 times [2019-09-08 04:10:54,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:54,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:54,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:54,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:10:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:10:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:10:54,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:10:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:10:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:10:54,353 INFO L87 Difference]: Start difference. First operand 551 states and 871 transitions. Second operand 8 states. [2019-09-08 04:10:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:57,210 INFO L93 Difference]: Finished difference Result 1991 states and 3207 transitions. [2019-09-08 04:10:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:10:57,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-09-08 04:10:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:57,225 INFO L225 Difference]: With dead ends: 1991 [2019-09-08 04:10:57,225 INFO L226 Difference]: Without dead ends: 1474 [2019-09-08 04:10:57,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:10:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-08 04:10:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1462. [2019-09-08 04:10:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2019-09-08 04:10:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2316 transitions. [2019-09-08 04:10:57,349 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2316 transitions. Word has length 123 [2019-09-08 04:10:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:10:57,352 INFO L475 AbstractCegarLoop]: Abstraction has 1462 states and 2316 transitions. [2019-09-08 04:10:57,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:10:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2316 transitions. [2019-09-08 04:10:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 04:10:57,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:10:57,355 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:10:57,356 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:10:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:10:57,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1777046166, now seen corresponding path program 1 times [2019-09-08 04:10:57,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:10:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:10:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:57,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:10:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 04:10:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:10:57,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:10:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:10:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:10:58,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:10:58,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:10:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:10:58,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:10:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:10:58,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:10:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:10:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:10:58,219 INFO L87 Difference]: Start difference. First operand 1462 states and 2316 transitions. Second operand 12 states. [2019-09-08 04:11:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:04,384 INFO L93 Difference]: Finished difference Result 7132 states and 11846 transitions. [2019-09-08 04:11:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:11:04,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-08 04:11:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:04,445 INFO L225 Difference]: With dead ends: 7132 [2019-09-08 04:11:04,445 INFO L226 Difference]: Without dead ends: 5704 [2019-09-08 04:11:04,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:11:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2019-09-08 04:11:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 3666. [2019-09-08 04:11:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2019-09-08 04:11:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5892 transitions. [2019-09-08 04:11:04,844 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5892 transitions. Word has length 128 [2019-09-08 04:11:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:04,844 INFO L475 AbstractCegarLoop]: Abstraction has 3666 states and 5892 transitions. [2019-09-08 04:11:04,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:11:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5892 transitions. [2019-09-08 04:11:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 04:11:04,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:04,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:04,848 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 183309761, now seen corresponding path program 1 times [2019-09-08 04:11:04,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:04,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:04,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:11:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:04,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:11:04,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:11:04,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:11:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:11:04,999 INFO L87 Difference]: Start difference. First operand 3666 states and 5892 transitions. Second operand 7 states. [2019-09-08 04:11:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:08,063 INFO L93 Difference]: Finished difference Result 10840 states and 17798 transitions. [2019-09-08 04:11:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:11:08,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 04:11:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:08,118 INFO L225 Difference]: With dead ends: 10840 [2019-09-08 04:11:08,118 INFO L226 Difference]: Without dead ends: 7208 [2019-09-08 04:11:08,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:11:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2019-09-08 04:11:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 7120. [2019-09-08 04:11:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7120 states. [2019-09-08 04:11:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 11538 transitions. [2019-09-08 04:11:08,557 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 11538 transitions. Word has length 131 [2019-09-08 04:11:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:08,558 INFO L475 AbstractCegarLoop]: Abstraction has 7120 states and 11538 transitions. [2019-09-08 04:11:08,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:11:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 11538 transitions. [2019-09-08 04:11:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 04:11:08,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:08,563 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:08,563 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1920102024, now seen corresponding path program 1 times [2019-09-08 04:11:08,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:08,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:08,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:11:08,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:08,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:11:08,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:11:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:11:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:11:08,765 INFO L87 Difference]: Start difference. First operand 7120 states and 11538 transitions. Second operand 4 states. [2019-09-08 04:11:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:09,077 INFO L93 Difference]: Finished difference Result 13925 states and 22834 transitions. [2019-09-08 04:11:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:11:09,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-08 04:11:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:09,155 INFO L225 Difference]: With dead ends: 13925 [2019-09-08 04:11:09,155 INFO L226 Difference]: Without dead ends: 6827 [2019-09-08 04:11:09,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:11:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6827 states. [2019-09-08 04:11:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6827 to 6805. [2019-09-08 04:11:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2019-09-08 04:11:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 11002 transitions. [2019-09-08 04:11:10,201 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 11002 transitions. Word has length 132 [2019-09-08 04:11:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:10,203 INFO L475 AbstractCegarLoop]: Abstraction has 6805 states and 11002 transitions. [2019-09-08 04:11:10,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:11:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 11002 transitions. [2019-09-08 04:11:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:11:10,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:10,206 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:10,206 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1656619662, now seen corresponding path program 1 times [2019-09-08 04:11:10,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:10,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:10,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 04:11:10,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:10,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:11:10,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:11:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:11:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:11:10,377 INFO L87 Difference]: Start difference. First operand 6805 states and 11002 transitions. Second operand 7 states. [2019-09-08 04:11:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:13,140 INFO L93 Difference]: Finished difference Result 20339 states and 33702 transitions. [2019-09-08 04:11:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:11:13,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-08 04:11:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:13,211 INFO L225 Difference]: With dead ends: 20339 [2019-09-08 04:11:13,211 INFO L226 Difference]: Without dead ends: 13568 [2019-09-08 04:11:13,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:11:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13568 states. [2019-09-08 04:11:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13568 to 13444. [2019-09-08 04:11:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13444 states. [2019-09-08 04:11:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13444 states to 13444 states and 22031 transitions. [2019-09-08 04:11:13,826 INFO L78 Accepts]: Start accepts. Automaton has 13444 states and 22031 transitions. Word has length 140 [2019-09-08 04:11:13,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:13,827 INFO L475 AbstractCegarLoop]: Abstraction has 13444 states and 22031 transitions. [2019-09-08 04:11:13,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:11:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 13444 states and 22031 transitions. [2019-09-08 04:11:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:11:13,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:13,830 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:13,830 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:13,831 INFO L82 PathProgramCache]: Analyzing trace with hash 807910319, now seen corresponding path program 1 times [2019-09-08 04:11:13,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:13,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:13,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:11:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:13,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:11:13,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:11:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:11:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:11:13,953 INFO L87 Difference]: Start difference. First operand 13444 states and 22031 transitions. Second operand 4 states. [2019-09-08 04:11:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:14,591 INFO L93 Difference]: Finished difference Result 26623 states and 44183 transitions. [2019-09-08 04:11:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:11:14,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-08 04:11:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:14,898 INFO L225 Difference]: With dead ends: 26623 [2019-09-08 04:11:14,899 INFO L226 Difference]: Without dead ends: 13201 [2019-09-08 04:11:14,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:11:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2019-09-08 04:11:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 13161. [2019-09-08 04:11:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-09-08 04:11:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 21522 transitions. [2019-09-08 04:11:15,469 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 21522 transitions. Word has length 141 [2019-09-08 04:11:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:15,469 INFO L475 AbstractCegarLoop]: Abstraction has 13161 states and 21522 transitions. [2019-09-08 04:11:15,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:11:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 21522 transitions. [2019-09-08 04:11:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:11:15,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:15,473 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:11:15,474 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:15,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1331376234, now seen corresponding path program 1 times [2019-09-08 04:11:15,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:15,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:15,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:11:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:11:15,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:11:15,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:11:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:11:15,632 INFO L87 Difference]: Start difference. First operand 13161 states and 21522 transitions. Second operand 7 states. [2019-09-08 04:11:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:18,541 INFO L93 Difference]: Finished difference Result 39523 states and 66617 transitions. [2019-09-08 04:11:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:11:18,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-08 04:11:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:18,745 INFO L225 Difference]: With dead ends: 39523 [2019-09-08 04:11:18,745 INFO L226 Difference]: Without dead ends: 26396 [2019-09-08 04:11:18,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:11:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26396 states. [2019-09-08 04:11:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26396 to 26212. [2019-09-08 04:11:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26212 states. [2019-09-08 04:11:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26212 states to 26212 states and 43764 transitions. [2019-09-08 04:11:21,066 INFO L78 Accepts]: Start accepts. Automaton has 26212 states and 43764 transitions. Word has length 150 [2019-09-08 04:11:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:21,067 INFO L475 AbstractCegarLoop]: Abstraction has 26212 states and 43764 transitions. [2019-09-08 04:11:21,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:11:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26212 states and 43764 transitions. [2019-09-08 04:11:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:11:21,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:21,074 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:11:21,075 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -962451857, now seen corresponding path program 1 times [2019-09-08 04:11:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 04:11:21,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:21,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:11:21,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:11:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:11:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:11:21,191 INFO L87 Difference]: Start difference. First operand 26212 states and 43764 transitions. Second operand 4 states. [2019-09-08 04:11:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:22,150 INFO L93 Difference]: Finished difference Result 52209 states and 88549 transitions. [2019-09-08 04:11:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:11:22,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 04:11:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:22,310 INFO L225 Difference]: With dead ends: 52209 [2019-09-08 04:11:22,311 INFO L226 Difference]: Without dead ends: 26019 [2019-09-08 04:11:22,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:11:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26019 states. [2019-09-08 04:11:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26019 to 25943. [2019-09-08 04:11:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25943 states. [2019-09-08 04:11:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25943 states to 25943 states and 43238 transitions. [2019-09-08 04:11:23,515 INFO L78 Accepts]: Start accepts. Automaton has 25943 states and 43238 transitions. Word has length 151 [2019-09-08 04:11:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:23,516 INFO L475 AbstractCegarLoop]: Abstraction has 25943 states and 43238 transitions. [2019-09-08 04:11:23,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:11:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25943 states and 43238 transitions. [2019-09-08 04:11:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:11:23,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:23,524 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:23,525 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 660328617, now seen corresponding path program 1 times [2019-09-08 04:11:23,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:23,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:11:23,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:23,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:11:23,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:11:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:11:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:11:23,707 INFO L87 Difference]: Start difference. First operand 25943 states and 43238 transitions. Second operand 7 states. [2019-09-08 04:11:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:27,388 INFO L93 Difference]: Finished difference Result 78041 states and 135348 transitions. [2019-09-08 04:11:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:11:27,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-08 04:11:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:29,086 INFO L225 Difference]: With dead ends: 78041 [2019-09-08 04:11:29,087 INFO L226 Difference]: Without dead ends: 52132 [2019-09-08 04:11:29,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:11:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52132 states. [2019-09-08 04:11:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52132 to 51848. [2019-09-08 04:11:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51848 states. [2019-09-08 04:11:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51848 states to 51848 states and 89207 transitions. [2019-09-08 04:11:31,199 INFO L78 Accepts]: Start accepts. Automaton has 51848 states and 89207 transitions. Word has length 161 [2019-09-08 04:11:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:31,200 INFO L475 AbstractCegarLoop]: Abstraction has 51848 states and 89207 transitions. [2019-09-08 04:11:31,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:11:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51848 states and 89207 transitions. [2019-09-08 04:11:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:11:31,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:31,206 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:31,206 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -199045944, now seen corresponding path program 1 times [2019-09-08 04:11:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:31,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:11:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:11:31,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:11:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:11:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:11:31,317 INFO L87 Difference]: Start difference. First operand 51848 states and 89207 transitions. Second operand 4 states. [2019-09-08 04:11:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:32,809 INFO L93 Difference]: Finished difference Result 102918 states and 180764 transitions. [2019-09-08 04:11:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:11:32,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 04:11:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:35,339 INFO L225 Difference]: With dead ends: 102918 [2019-09-08 04:11:35,339 INFO L226 Difference]: Without dead ends: 51086 [2019-09-08 04:11:35,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:11:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51086 states. [2019-09-08 04:11:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51086 to 50942. [2019-09-08 04:11:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50942 states. [2019-09-08 04:11:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50942 states to 50942 states and 87329 transitions. [2019-09-08 04:11:37,330 INFO L78 Accepts]: Start accepts. Automaton has 50942 states and 87329 transitions. Word has length 162 [2019-09-08 04:11:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:37,330 INFO L475 AbstractCegarLoop]: Abstraction has 50942 states and 87329 transitions. [2019-09-08 04:11:37,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:11:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 50942 states and 87329 transitions. [2019-09-08 04:11:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 04:11:37,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:37,333 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:37,333 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1264859282, now seen corresponding path program 1 times [2019-09-08 04:11:37,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:37,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:37,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:11:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:37,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:11:37,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:11:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:11:37,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:11:37,550 INFO L87 Difference]: Start difference. First operand 50942 states and 87329 transitions. Second operand 12 states. [2019-09-08 04:11:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:11:45,732 INFO L93 Difference]: Finished difference Result 173330 states and 312335 transitions. [2019-09-08 04:11:45,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:11:45,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2019-09-08 04:11:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:11:46,816 INFO L225 Difference]: With dead ends: 173330 [2019-09-08 04:11:46,816 INFO L226 Difference]: Without dead ends: 122422 [2019-09-08 04:11:47,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:11:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122422 states. [2019-09-08 04:11:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122422 to 122090. [2019-09-08 04:11:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122090 states. [2019-09-08 04:11:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122090 states to 122090 states and 210631 transitions. [2019-09-08 04:11:56,464 INFO L78 Accepts]: Start accepts. Automaton has 122090 states and 210631 transitions. Word has length 163 [2019-09-08 04:11:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:11:56,464 INFO L475 AbstractCegarLoop]: Abstraction has 122090 states and 210631 transitions. [2019-09-08 04:11:56,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:11:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 122090 states and 210631 transitions. [2019-09-08 04:11:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:11:56,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:11:56,466 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:11:56,466 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:11:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:11:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 502520219, now seen corresponding path program 1 times [2019-09-08 04:11:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:11:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:11:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:11:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:11:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:11:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:11:56,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:11:56,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:11:56,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:11:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:11:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:11:56,660 INFO L87 Difference]: Start difference. First operand 122090 states and 210631 transitions. Second operand 12 states. [2019-09-08 04:12:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:14,101 INFO L93 Difference]: Finished difference Result 399227 states and 712144 transitions. [2019-09-08 04:12:14,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:12:14,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-08 04:12:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:15,353 INFO L225 Difference]: With dead ends: 399227 [2019-09-08 04:12:15,353 INFO L226 Difference]: Without dead ends: 277139 [2019-09-08 04:12:16,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:12:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-09-08 04:12:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 272335. [2019-09-08 04:12:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272335 states. [2019-09-08 04:12:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272335 states to 272335 states and 468388 transitions. [2019-09-08 04:12:46,483 INFO L78 Accepts]: Start accepts. Automaton has 272335 states and 468388 transitions. Word has length 164 [2019-09-08 04:12:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:46,483 INFO L475 AbstractCegarLoop]: Abstraction has 272335 states and 468388 transitions. [2019-09-08 04:12:46,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:12:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 272335 states and 468388 transitions. [2019-09-08 04:12:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 04:12:46,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:46,486 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:46,486 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash -46997110, now seen corresponding path program 1 times [2019-09-08 04:12:46,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:46,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:12:46,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:46,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:12:46,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:12:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:12:46,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:12:46,677 INFO L87 Difference]: Start difference. First operand 272335 states and 468388 transitions. Second operand 12 states. [2019-09-08 04:13:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:18,991 INFO L93 Difference]: Finished difference Result 763064 states and 1347643 transitions. [2019-09-08 04:13:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:13:18,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2019-09-08 04:13:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:33,209 INFO L225 Difference]: With dead ends: 763064 [2019-09-08 04:13:33,209 INFO L226 Difference]: Without dead ends: 490019 [2019-09-08 04:13:45,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:13:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490019 states. [2019-09-08 04:14:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490019 to 479259. [2019-09-08 04:14:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479259 states. [2019-09-08 04:14:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479259 states to 479259 states and 819905 transitions. [2019-09-08 04:14:17,154 INFO L78 Accepts]: Start accepts. Automaton has 479259 states and 819905 transitions. Word has length 165 [2019-09-08 04:14:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:14:17,155 INFO L475 AbstractCegarLoop]: Abstraction has 479259 states and 819905 transitions. [2019-09-08 04:14:17,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:14:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 479259 states and 819905 transitions. [2019-09-08 04:14:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:14:17,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:14:17,157 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-09-08 04:14:17,158 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:14:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:14:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash 594127863, now seen corresponding path program 1 times [2019-09-08 04:14:17,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:14:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:14:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:14:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:14:17,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:14:17,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:14:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:14:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:14:17,358 INFO L87 Difference]: Start difference. First operand 479259 states and 819905 transitions. Second operand 12 states. [2019-09-08 04:16:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:09,390 INFO L93 Difference]: Finished difference Result 1425902 states and 2507853 transitions. [2019-09-08 04:16:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 04:16:09,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-09-08 04:16:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:18,311 INFO L225 Difference]: With dead ends: 1425902 [2019-09-08 04:16:18,312 INFO L226 Difference]: Without dead ends: 945833