java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:23:05,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:23:05,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:23:05,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:23:05,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:23:05,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:23:05,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:23:05,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:23:05,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:23:05,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:23:05,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:23:05,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:23:05,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:23:05,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:23:05,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:23:05,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:23:05,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:23:05,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:23:05,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:23:05,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:23:05,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:23:05,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:23:05,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:23:05,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:23:05,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:23:05,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:23:05,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:23:05,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:23:05,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:23:05,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:23:05,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:23:05,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:23:05,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:23:05,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:23:05,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:23:05,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:23:05,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:23:05,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:23:05,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:23:05,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:23:05,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:23:05,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:23:05,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:23:05,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:23:05,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:23:05,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:23:05,339 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:23:05,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:23:05,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:23:05,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:23:05,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:23:05,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:23:05,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:23:05,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:23:05,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:23:05,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:23:05,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:23:05,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:23:05,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:23:05,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:23:05,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:23:05,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:23:05,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:23:05,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:23:05,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:23:05,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:23:05,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:23:05,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:23:05,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:23:05,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:23:05,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:23:05,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:23:05,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:23:05,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:23:05,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:23:05,429 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:23:05,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-02 12:23:05,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a691b36/cc23eecb0d0040a3bb609eb726e6edea/FLAGd78e29918 [2019-10-02 12:23:06,278 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:23:06,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-02 12:23:06,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a691b36/cc23eecb0d0040a3bb609eb726e6edea/FLAGd78e29918 [2019-10-02 12:23:06,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a691b36/cc23eecb0d0040a3bb609eb726e6edea [2019-10-02 12:23:06,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:23:06,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:23:06,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:23:06,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:23:06,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:23:06,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:23:06" (1/1) ... [2019-10-02 12:23:06,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4caf3c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:06, skipping insertion in model container [2019-10-02 12:23:06,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:23:06" (1/1) ... [2019-10-02 12:23:06,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:23:06,930 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:23:07,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:23:07,777 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:23:07,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:23:08,034 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:23:08,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08 WrapperNode [2019-10-02 12:23:08,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:23:08,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:23:08,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:23:08,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:23:08,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... [2019-10-02 12:23:08,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:23:08,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:23:08,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:23:08,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:23:08,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:23:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:23:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:23:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:23:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:23:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:23:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:23:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:23:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:23:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:23:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:23:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:23:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:23:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:23:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:23:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:23:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:23:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:23:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:23:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:23:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:23:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:23:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:23:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:23:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:23:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:23:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:23:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:23:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:23:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:23:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:23:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:23:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:23:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:23:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:23:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-02 12:23:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-02 12:23:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:23:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-02 12:23:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-02 12:23:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:23:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-02 12:23:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-02 12:23:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:23:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:23:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:23:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:23:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:23:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:23:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:23:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:23:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:23:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:23:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:23:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:23:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:23:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:23:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:23:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:23:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-02 12:23:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-02 12:23:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:23:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-02 12:23:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-02 12:23:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:23:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:23:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:23:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:23:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:23:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:23:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:23:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:23:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:23:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:23:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:23:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:23:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:23:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:23:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:23:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:23:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:23:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:23:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:23:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:23:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:23:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:23:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:23:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:23:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:23:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:23:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:23:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:23:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:23:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:23:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:23:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:23:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:23:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:23:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:23:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:23:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:23:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:23:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:23:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:23:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:23:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:23:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:23:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:23:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:23:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-02 12:23:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:23:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-02 12:23:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-02 12:23:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:23:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:23:08,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:23:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:23:10,825 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:23:10,825 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:23:10,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:23:10 BoogieIcfgContainer [2019-10-02 12:23:10,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:23:10,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:23:10,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:23:10,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:23:10,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:23:06" (1/3) ... [2019-10-02 12:23:10,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:23:10, skipping insertion in model container [2019-10-02 12:23:10,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:08" (2/3) ... [2019-10-02 12:23:10,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:23:10, skipping insertion in model container [2019-10-02 12:23:10,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:23:10" (3/3) ... [2019-10-02 12:23:10,839 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.c [2019-10-02 12:23:10,850 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:23:10,869 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:23:10,889 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:23:10,947 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:23:10,948 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:23:10,948 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:23:10,949 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:23:10,949 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:23:10,949 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:23:10,949 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:23:10,950 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:23:10,950 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:23:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states. [2019-10-02 12:23:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 12:23:11,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:11,038 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:11,042 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1390055657, now seen corresponding path program 1 times [2019-10-02 12:23:11,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:11,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:11,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:11,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:11,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:11,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:11,865 INFO L87 Difference]: Start difference. First operand 926 states. Second operand 6 states. [2019-10-02 12:23:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:12,056 INFO L93 Difference]: Finished difference Result 1497 states and 2337 transitions. [2019-10-02 12:23:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:12,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-02 12:23:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:12,091 INFO L225 Difference]: With dead ends: 1497 [2019-10-02 12:23:12,091 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:12,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:23:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1165 transitions. [2019-10-02 12:23:12,263 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1165 transitions. Word has length 119 [2019-10-02 12:23:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:12,271 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1165 transitions. [2019-10-02 12:23:12,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1165 transitions. [2019-10-02 12:23:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:23:12,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:12,284 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:12,284 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -232939241, now seen corresponding path program 1 times [2019-10-02 12:23:12,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:12,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:12,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:12,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:12,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:12,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:12,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:12,598 INFO L87 Difference]: Start difference. First operand 754 states and 1165 transitions. Second operand 4 states. [2019-10-02 12:23:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:12,682 INFO L93 Difference]: Finished difference Result 1450 states and 2260 transitions. [2019-10-02 12:23:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:12,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-02 12:23:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:12,690 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:12,691 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:12,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1164 transitions. [2019-10-02 12:23:12,739 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1164 transitions. Word has length 122 [2019-10-02 12:23:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:12,740 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1164 transitions. [2019-10-02 12:23:12,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1164 transitions. [2019-10-02 12:23:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:23:12,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:12,744 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:12,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1715522467, now seen corresponding path program 1 times [2019-10-02 12:23:12,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:12,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:12,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:12,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:12,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:12,968 INFO L87 Difference]: Start difference. First operand 754 states and 1164 transitions. Second operand 4 states. [2019-10-02 12:23:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:13,038 INFO L93 Difference]: Finished difference Result 1450 states and 2259 transitions. [2019-10-02 12:23:13,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:13,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-02 12:23:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:13,045 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:13,045 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:13,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1163 transitions. [2019-10-02 12:23:13,081 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1163 transitions. Word has length 123 [2019-10-02 12:23:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:13,082 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1163 transitions. [2019-10-02 12:23:13,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1163 transitions. [2019-10-02 12:23:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:23:13,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:13,085 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:13,086 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1903026157, now seen corresponding path program 1 times [2019-10-02 12:23:13,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:13,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:13,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:13,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:13,285 INFO L87 Difference]: Start difference. First operand 754 states and 1163 transitions. Second operand 4 states. [2019-10-02 12:23:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:13,362 INFO L93 Difference]: Finished difference Result 1450 states and 2258 transitions. [2019-10-02 12:23:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:13,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-02 12:23:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:13,377 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:13,377 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:13,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1162 transitions. [2019-10-02 12:23:13,421 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1162 transitions. Word has length 124 [2019-10-02 12:23:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:13,421 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1162 transitions. [2019-10-02 12:23:13,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1162 transitions. [2019-10-02 12:23:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:23:13,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:13,428 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:13,428 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2005235937, now seen corresponding path program 1 times [2019-10-02 12:23:13,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:13,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:13,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:13,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:13,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:13,601 INFO L87 Difference]: Start difference. First operand 754 states and 1162 transitions. Second operand 4 states. [2019-10-02 12:23:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:13,678 INFO L93 Difference]: Finished difference Result 1450 states and 2257 transitions. [2019-10-02 12:23:13,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:13,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-02 12:23:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:13,692 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:13,692 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:13,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1161 transitions. [2019-10-02 12:23:13,742 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1161 transitions. Word has length 125 [2019-10-02 12:23:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:13,743 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1161 transitions. [2019-10-02 12:23:13,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1161 transitions. [2019-10-02 12:23:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 12:23:13,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:13,748 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:13,748 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash -475123953, now seen corresponding path program 1 times [2019-10-02 12:23:13,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:13,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:13,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:13,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:13,979 INFO L87 Difference]: Start difference. First operand 754 states and 1161 transitions. Second operand 4 states. [2019-10-02 12:23:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:14,043 INFO L93 Difference]: Finished difference Result 1450 states and 2256 transitions. [2019-10-02 12:23:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:14,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-02 12:23:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:14,051 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:14,051 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:14,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1160 transitions. [2019-10-02 12:23:14,086 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1160 transitions. Word has length 126 [2019-10-02 12:23:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:14,087 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1160 transitions. [2019-10-02 12:23:14,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1160 transitions. [2019-10-02 12:23:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 12:23:14,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:14,090 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:14,090 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash 218267130, now seen corresponding path program 1 times [2019-10-02 12:23:14,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:14,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:14,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:14,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:14,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:14,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:14,236 INFO L87 Difference]: Start difference. First operand 754 states and 1160 transitions. Second operand 4 states. [2019-10-02 12:23:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:14,298 INFO L93 Difference]: Finished difference Result 1450 states and 2255 transitions. [2019-10-02 12:23:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:14,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-02 12:23:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:14,305 INFO L225 Difference]: With dead ends: 1450 [2019-10-02 12:23:14,306 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 12:23:14,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:23:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 12:23:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-02 12:23:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-02 12:23:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1159 transitions. [2019-10-02 12:23:14,346 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1159 transitions. Word has length 127 [2019-10-02 12:23:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:14,347 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1159 transitions. [2019-10-02 12:23:14,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1159 transitions. [2019-10-02 12:23:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 12:23:14,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:14,350 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:14,350 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash 117355163, now seen corresponding path program 1 times [2019-10-02 12:23:14,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:14,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:23:14,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:23:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:23:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:14,536 INFO L87 Difference]: Start difference. First operand 754 states and 1159 transitions. Second operand 9 states. [2019-10-02 12:23:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:14,930 INFO L93 Difference]: Finished difference Result 1402 states and 2167 transitions. [2019-10-02 12:23:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:23:14,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-10-02 12:23:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:14,937 INFO L225 Difference]: With dead ends: 1402 [2019-10-02 12:23:14,937 INFO L226 Difference]: Without dead ends: 748 [2019-10-02 12:23:14,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:23:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-02 12:23:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-02 12:23:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-02 12:23:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1146 transitions. [2019-10-02 12:23:14,975 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1146 transitions. Word has length 127 [2019-10-02 12:23:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:14,976 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1146 transitions. [2019-10-02 12:23:14,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:23:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1146 transitions. [2019-10-02 12:23:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:23:15,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:15,018 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:15,018 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108187, now seen corresponding path program 1 times [2019-10-02 12:23:15,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:15,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:15,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:15,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:15,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:15,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:15,173 INFO L87 Difference]: Start difference. First operand 748 states and 1146 transitions. Second operand 6 states. [2019-10-02 12:23:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:15,417 INFO L93 Difference]: Finished difference Result 1396 states and 2154 transitions. [2019-10-02 12:23:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:15,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-02 12:23:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:15,425 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 12:23:15,425 INFO L226 Difference]: Without dead ends: 748 [2019-10-02 12:23:15,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-02 12:23:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-02 12:23:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-02 12:23:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1142 transitions. [2019-10-02 12:23:15,470 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1142 transitions. Word has length 128 [2019-10-02 12:23:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:15,471 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1142 transitions. [2019-10-02 12:23:15,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1142 transitions. [2019-10-02 12:23:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 12:23:15,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:15,475 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:15,475 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:15,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1697144642, now seen corresponding path program 1 times [2019-10-02 12:23:15,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:15,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:15,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:15,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:15,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:15,613 INFO L87 Difference]: Start difference. First operand 748 states and 1142 transitions. Second operand 6 states. [2019-10-02 12:23:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:15,824 INFO L93 Difference]: Finished difference Result 1396 states and 2150 transitions. [2019-10-02 12:23:15,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:15,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 12:23:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:15,832 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 12:23:15,832 INFO L226 Difference]: Without dead ends: 748 [2019-10-02 12:23:15,837 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-02 12:23:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-02 12:23:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-02 12:23:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1138 transitions. [2019-10-02 12:23:15,872 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1138 transitions. Word has length 129 [2019-10-02 12:23:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:15,873 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1138 transitions. [2019-10-02 12:23:15,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1138 transitions. [2019-10-02 12:23:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:23:15,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:15,875 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:15,876 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1882039414, now seen corresponding path program 1 times [2019-10-02 12:23:15,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:15,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:15,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:15,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:16,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:16,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:16,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:16,014 INFO L87 Difference]: Start difference. First operand 748 states and 1138 transitions. Second operand 6 states. [2019-10-02 12:23:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:16,236 INFO L93 Difference]: Finished difference Result 1396 states and 2146 transitions. [2019-10-02 12:23:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:16,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-02 12:23:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:16,245 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 12:23:16,245 INFO L226 Difference]: Without dead ends: 748 [2019-10-02 12:23:16,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-02 12:23:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-02 12:23:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-02 12:23:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1134 transitions. [2019-10-02 12:23:16,285 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1134 transitions. Word has length 130 [2019-10-02 12:23:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:16,286 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1134 transitions. [2019-10-02 12:23:16,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1134 transitions. [2019-10-02 12:23:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:23:16,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:16,290 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:16,290 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1517623306, now seen corresponding path program 1 times [2019-10-02 12:23:16,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:16,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:16,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:23:16,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:23:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:23:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:23:16,461 INFO L87 Difference]: Start difference. First operand 748 states and 1134 transitions. Second operand 7 states. [2019-10-02 12:23:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:16,557 INFO L93 Difference]: Finished difference Result 1396 states and 2142 transitions. [2019-10-02 12:23:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:23:16,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-02 12:23:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:16,563 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 12:23:16,563 INFO L226 Difference]: Without dead ends: 727 [2019-10-02 12:23:16,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-02 12:23:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-02 12:23:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-02 12:23:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1100 transitions. [2019-10-02 12:23:16,592 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1100 transitions. Word has length 130 [2019-10-02 12:23:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:16,593 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1100 transitions. [2019-10-02 12:23:16,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:23:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1100 transitions. [2019-10-02 12:23:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:23:16,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:16,595 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:16,596 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash -61574717, now seen corresponding path program 1 times [2019-10-02 12:23:16,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:16,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:16,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:16,722 INFO L87 Difference]: Start difference. First operand 727 states and 1100 transitions. Second operand 6 states. [2019-10-02 12:23:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:16,825 INFO L93 Difference]: Finished difference Result 1375 states and 2108 transitions. [2019-10-02 12:23:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:16,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-02 12:23:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:16,831 INFO L225 Difference]: With dead ends: 1375 [2019-10-02 12:23:16,832 INFO L226 Difference]: Without dead ends: 727 [2019-10-02 12:23:16,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-02 12:23:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-02 12:23:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-02 12:23:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1099 transitions. [2019-10-02 12:23:16,861 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1099 transitions. Word has length 131 [2019-10-02 12:23:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:16,862 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1099 transitions. [2019-10-02 12:23:16,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1099 transitions. [2019-10-02 12:23:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 12:23:16,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:16,865 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:16,865 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:16,866 INFO L82 PathProgramCache]: Analyzing trace with hash -499475921, now seen corresponding path program 1 times [2019-10-02 12:23:16,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:16,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:17,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:17,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:17,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:17,049 INFO L87 Difference]: Start difference. First operand 727 states and 1099 transitions. Second operand 6 states. [2019-10-02 12:23:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:17,188 INFO L93 Difference]: Finished difference Result 1375 states and 2107 transitions. [2019-10-02 12:23:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:17,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-02 12:23:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:17,196 INFO L225 Difference]: With dead ends: 1375 [2019-10-02 12:23:17,196 INFO L226 Difference]: Without dead ends: 727 [2019-10-02 12:23:17,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-02 12:23:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-02 12:23:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-02 12:23:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1098 transitions. [2019-10-02 12:23:17,238 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1098 transitions. Word has length 132 [2019-10-02 12:23:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:17,239 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1098 transitions. [2019-10-02 12:23:17,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1098 transitions. [2019-10-02 12:23:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:23:17,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:17,243 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:17,243 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2067723976, now seen corresponding path program 1 times [2019-10-02 12:23:17,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:17,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:17,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:17,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:17,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:17,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:23:17,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:23:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:23:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:23:17,508 INFO L87 Difference]: Start difference. First operand 727 states and 1098 transitions. Second operand 11 states. [2019-10-02 12:23:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:17,890 INFO L93 Difference]: Finished difference Result 1376 states and 2106 transitions. [2019-10-02 12:23:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:23:17,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-10-02 12:23:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:17,896 INFO L225 Difference]: With dead ends: 1376 [2019-10-02 12:23:17,896 INFO L226 Difference]: Without dead ends: 727 [2019-10-02 12:23:17,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:23:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-02 12:23:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-02 12:23:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-02 12:23:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1097 transitions. [2019-10-02 12:23:17,927 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1097 transitions. Word has length 133 [2019-10-02 12:23:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:17,927 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1097 transitions. [2019-10-02 12:23:17,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:23:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1097 transitions. [2019-10-02 12:23:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:23:17,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:17,930 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:17,930 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1980443808, now seen corresponding path program 1 times [2019-10-02 12:23:17,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:17,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:18,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:18,065 INFO L87 Difference]: Start difference. First operand 727 states and 1097 transitions. Second operand 4 states. [2019-10-02 12:23:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:19,442 INFO L93 Difference]: Finished difference Result 2040 states and 3133 transitions. [2019-10-02 12:23:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:19,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-02 12:23:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:19,458 INFO L225 Difference]: With dead ends: 2040 [2019-10-02 12:23:19,458 INFO L226 Difference]: Without dead ends: 1400 [2019-10-02 12:23:19,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-10-02 12:23:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1387. [2019-10-02 12:23:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-02 12:23:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2107 transitions. [2019-10-02 12:23:19,565 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2107 transitions. Word has length 134 [2019-10-02 12:23:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:19,567 INFO L475 AbstractCegarLoop]: Abstraction has 1387 states and 2107 transitions. [2019-10-02 12:23:19,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2107 transitions. [2019-10-02 12:23:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:23:19,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:19,574 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:19,574 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1183400857, now seen corresponding path program 1 times [2019-10-02 12:23:19,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:19,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:19,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:19,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:19,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:19,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:19,932 INFO L87 Difference]: Start difference. First operand 1387 states and 2107 transitions. Second operand 6 states. [2019-10-02 12:23:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:24,840 INFO L93 Difference]: Finished difference Result 3471 states and 5469 transitions. [2019-10-02 12:23:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:24,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-02 12:23:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:24,871 INFO L225 Difference]: With dead ends: 3471 [2019-10-02 12:23:24,871 INFO L226 Difference]: Without dead ends: 2838 [2019-10-02 12:23:24,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-02 12:23:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2789. [2019-10-02 12:23:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-10-02 12:23:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4412 transitions. [2019-10-02 12:23:25,060 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4412 transitions. Word has length 135 [2019-10-02 12:23:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:25,061 INFO L475 AbstractCegarLoop]: Abstraction has 2789 states and 4412 transitions. [2019-10-02 12:23:25,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4412 transitions. [2019-10-02 12:23:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:23:25,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:25,073 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:25,073 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -185210926, now seen corresponding path program 1 times [2019-10-02 12:23:25,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:25,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:25,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:25,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:23:25,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:23:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:23:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:25,339 INFO L87 Difference]: Start difference. First operand 2789 states and 4412 transitions. Second operand 9 states. [2019-10-02 12:23:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:30,500 INFO L93 Difference]: Finished difference Result 5459 states and 8816 transitions. [2019-10-02 12:23:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:23:30,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-10-02 12:23:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:30,526 INFO L225 Difference]: With dead ends: 5459 [2019-10-02 12:23:30,526 INFO L226 Difference]: Without dead ends: 2813 [2019-10-02 12:23:30,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:23:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-10-02 12:23:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2805. [2019-10-02 12:23:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-10-02 12:23:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4492 transitions. [2019-10-02 12:23:30,769 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4492 transitions. Word has length 180 [2019-10-02 12:23:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:30,770 INFO L475 AbstractCegarLoop]: Abstraction has 2805 states and 4492 transitions. [2019-10-02 12:23:30,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:23:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4492 transitions. [2019-10-02 12:23:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:23:30,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:30,787 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:30,788 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 748218603, now seen corresponding path program 1 times [2019-10-02 12:23:30,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:23:31,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:23:31,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:23:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:23:31,065 INFO L87 Difference]: Start difference. First operand 2805 states and 4492 transitions. Second operand 8 states. [2019-10-02 12:23:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:39,964 INFO L93 Difference]: Finished difference Result 10521 states and 17486 transitions. [2019-10-02 12:23:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:23:39,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-02 12:23:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:40,040 INFO L225 Difference]: With dead ends: 10521 [2019-10-02 12:23:40,040 INFO L226 Difference]: Without dead ends: 7859 [2019-10-02 12:23:40,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:23:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7859 states. [2019-10-02 12:23:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7859 to 7785. [2019-10-02 12:23:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7785 states. [2019-10-02 12:23:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 12512 transitions. [2019-10-02 12:23:40,491 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 12512 transitions. Word has length 181 [2019-10-02 12:23:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:40,492 INFO L475 AbstractCegarLoop]: Abstraction has 7785 states and 12512 transitions. [2019-10-02 12:23:40,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:23:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 12512 transitions. [2019-10-02 12:23:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:23:40,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:40,503 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:40,503 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1478649548, now seen corresponding path program 1 times [2019-10-02 12:23:40,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:40,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:23:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:23:40,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:23:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:23:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:40,673 INFO L87 Difference]: Start difference. First operand 7785 states and 12512 transitions. Second operand 4 states. [2019-10-02 12:23:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:42,359 INFO L93 Difference]: Finished difference Result 22712 states and 37282 transitions. [2019-10-02 12:23:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:23:42,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-10-02 12:23:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:42,482 INFO L225 Difference]: With dead ends: 22712 [2019-10-02 12:23:42,482 INFO L226 Difference]: Without dead ends: 15070 [2019-10-02 12:23:42,526 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:23:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15070 states. [2019-10-02 12:23:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15070 to 15057. [2019-10-02 12:23:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15057 states. [2019-10-02 12:23:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15057 states to 15057 states and 24208 transitions. [2019-10-02 12:23:43,367 INFO L78 Accepts]: Start accepts. Automaton has 15057 states and 24208 transitions. Word has length 185 [2019-10-02 12:23:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:43,368 INFO L475 AbstractCegarLoop]: Abstraction has 15057 states and 24208 transitions. [2019-10-02 12:23:43,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:23:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15057 states and 24208 transitions. [2019-10-02 12:23:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:23:43,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:43,386 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:43,386 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 836436416, now seen corresponding path program 1 times [2019-10-02 12:23:43,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:43,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:43,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:23:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:43,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:43,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:43,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:43,554 INFO L87 Difference]: Start difference. First operand 15057 states and 24208 transitions. Second operand 6 states. [2019-10-02 12:23:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:45,429 INFO L93 Difference]: Finished difference Result 29908 states and 48728 transitions. [2019-10-02 12:23:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:45,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2019-10-02 12:23:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:45,561 INFO L225 Difference]: With dead ends: 29908 [2019-10-02 12:23:45,561 INFO L226 Difference]: Without dead ends: 15105 [2019-10-02 12:23:45,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15105 states. [2019-10-02 12:23:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15105 to 15105. [2019-10-02 12:23:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15105 states. [2019-10-02 12:23:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15105 states to 15105 states and 24232 transitions. [2019-10-02 12:23:46,431 INFO L78 Accepts]: Start accepts. Automaton has 15105 states and 24232 transitions. Word has length 185 [2019-10-02 12:23:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:46,431 INFO L475 AbstractCegarLoop]: Abstraction has 15105 states and 24232 transitions. [2019-10-02 12:23:46,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 15105 states and 24232 transitions. [2019-10-02 12:23:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:23:46,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:46,446 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:46,446 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash -36902761, now seen corresponding path program 1 times [2019-10-02 12:23:46,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:46,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:46,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:23:46,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:46,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:23:46,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:23:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:23:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:23:46,673 INFO L87 Difference]: Start difference. First operand 15105 states and 24232 transitions. Second operand 6 states. [2019-10-02 12:23:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:23:48,179 INFO L93 Difference]: Finished difference Result 30076 states and 49280 transitions. [2019-10-02 12:23:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:23:48,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-10-02 12:23:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:23:48,262 INFO L225 Difference]: With dead ends: 30076 [2019-10-02 12:23:48,263 INFO L226 Difference]: Without dead ends: 15225 [2019-10-02 12:23:48,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-10-02 12:23:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15225. [2019-10-02 12:23:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15225 states. [2019-10-02 12:23:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15225 states to 15225 states and 24304 transitions. [2019-10-02 12:23:49,062 INFO L78 Accepts]: Start accepts. Automaton has 15225 states and 24304 transitions. Word has length 186 [2019-10-02 12:23:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:49,063 INFO L475 AbstractCegarLoop]: Abstraction has 15225 states and 24304 transitions. [2019-10-02 12:23:49,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:23:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 15225 states and 24304 transitions. [2019-10-02 12:23:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:23:49,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:49,894 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:49,894 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2106372179, now seen corresponding path program 1 times [2019-10-02 12:23:49,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:49,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:49,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:49,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:23:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:23:50,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:23:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:23:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:50,132 INFO L87 Difference]: Start difference. First operand 15225 states and 24304 transitions. Second operand 9 states. [2019-10-02 12:24:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:02,116 INFO L93 Difference]: Finished difference Result 50487 states and 84842 transitions. [2019-10-02 12:24:02,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:24:02,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2019-10-02 12:24:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:02,273 INFO L225 Difference]: With dead ends: 50487 [2019-10-02 12:24:02,273 INFO L226 Difference]: Without dead ends: 35516 [2019-10-02 12:24:02,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:24:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35516 states. [2019-10-02 12:24:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35516 to 33175. [2019-10-02 12:24:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33175 states. [2019-10-02 12:24:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33175 states to 33175 states and 54220 transitions. [2019-10-02 12:24:04,881 INFO L78 Accepts]: Start accepts. Automaton has 33175 states and 54220 transitions. Word has length 187 [2019-10-02 12:24:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:04,882 INFO L475 AbstractCegarLoop]: Abstraction has 33175 states and 54220 transitions. [2019-10-02 12:24:04,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:24:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 33175 states and 54220 transitions. [2019-10-02 12:24:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:24:04,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:04,901 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:04,901 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:04,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1942282030, now seen corresponding path program 1 times [2019-10-02 12:24:04,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:04,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:04,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:04,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:24:05,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:05,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:24:05,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:24:05,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:24:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:24:05,109 INFO L87 Difference]: Start difference. First operand 33175 states and 54220 transitions. Second operand 11 states. [2019-10-02 12:24:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:17,425 INFO L93 Difference]: Finished difference Result 85361 states and 140460 transitions. [2019-10-02 12:24:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:24:17,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-02 12:24:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:17,793 INFO L225 Difference]: With dead ends: 85361 [2019-10-02 12:24:17,793 INFO L226 Difference]: Without dead ends: 60968 [2019-10-02 12:24:17,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:24:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60968 states. [2019-10-02 12:24:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60968 to 60211. [2019-10-02 12:24:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60211 states. [2019-10-02 12:24:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60211 states to 60211 states and 98340 transitions. [2019-10-02 12:24:20,690 INFO L78 Accepts]: Start accepts. Automaton has 60211 states and 98340 transitions. Word has length 187 [2019-10-02 12:24:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:20,691 INFO L475 AbstractCegarLoop]: Abstraction has 60211 states and 98340 transitions. [2019-10-02 12:24:20,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:24:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 60211 states and 98340 transitions. [2019-10-02 12:24:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:24:20,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:20,709 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:20,709 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1949423258, now seen corresponding path program 1 times [2019-10-02 12:24:20,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:24:20,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:20,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:24:20,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:24:20,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:24:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:24:20,854 INFO L87 Difference]: Start difference. First operand 60211 states and 98340 transitions. Second operand 4 states. [2019-10-02 12:24:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:27,744 INFO L93 Difference]: Finished difference Result 173420 states and 290216 transitions. [2019-10-02 12:24:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:24:27,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-10-02 12:24:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:28,332 INFO L225 Difference]: With dead ends: 173420 [2019-10-02 12:24:28,332 INFO L226 Difference]: Without dead ends: 113479 [2019-10-02 12:24:28,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:24:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113479 states. [2019-10-02 12:24:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113479 to 113370. [2019-10-02 12:24:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113370 states. [2019-10-02 12:24:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113370 states to 113370 states and 186308 transitions. [2019-10-02 12:24:36,148 INFO L78 Accepts]: Start accepts. Automaton has 113370 states and 186308 transitions. Word has length 197 [2019-10-02 12:24:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:36,149 INFO L475 AbstractCegarLoop]: Abstraction has 113370 states and 186308 transitions. [2019-10-02 12:24:36,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:24:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113370 states and 186308 transitions. [2019-10-02 12:24:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:24:36,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:36,171 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:36,171 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:36,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1923410824, now seen corresponding path program 1 times [2019-10-02 12:24:36,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:36,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:36,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:24:36,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:24:36,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:24:36,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:24:36,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:24:36,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:36,378 INFO L87 Difference]: Start difference. First operand 113370 states and 186308 transitions. Second operand 9 states. [2019-10-02 12:24:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:42,589 INFO L93 Difference]: Finished difference Result 138523 states and 228276 transitions. [2019-10-02 12:24:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:24:42,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-10-02 12:24:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:43,232 INFO L225 Difference]: With dead ends: 138523 [2019-10-02 12:24:43,232 INFO L226 Difference]: Without dead ends: 115058 [2019-10-02 12:24:43,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115058 states. [2019-10-02 12:24:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115058 to 113858. [2019-10-02 12:24:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113858 states. [2019-10-02 12:24:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113858 states to 113858 states and 186923 transitions. [2019-10-02 12:24:48,117 INFO L78 Accepts]: Start accepts. Automaton has 113858 states and 186923 transitions. Word has length 192 [2019-10-02 12:24:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:24:48,118 INFO L475 AbstractCegarLoop]: Abstraction has 113858 states and 186923 transitions. [2019-10-02 12:24:48,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:24:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 113858 states and 186923 transitions. [2019-10-02 12:24:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:24:48,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:24:48,133 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:24:48,133 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:24:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:24:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1599319028, now seen corresponding path program 1 times [2019-10-02 12:24:48,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:24:48,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:24:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:24:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:24:48,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:24:48,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:24:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:24:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:24:48,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 3274 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:24:48,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:24:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:24:49,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:24:49,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:24:49,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:24:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:24:49,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:24:49,063 INFO L87 Difference]: Start difference. First operand 113858 states and 186923 transitions. Second operand 9 states. [2019-10-02 12:24:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:59,860 INFO L93 Difference]: Finished difference Result 228599 states and 381818 transitions. [2019-10-02 12:24:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:24:59,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-02 12:24:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:00,944 INFO L225 Difference]: With dead ends: 228599 [2019-10-02 12:25:00,945 INFO L226 Difference]: Without dead ends: 115058 [2019-10-02 12:25:01,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:25:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115058 states. [2019-10-02 12:25:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115058 to 115058. [2019-10-02 12:25:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115058 states. [2019-10-02 12:25:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115058 states to 115058 states and 187795 transitions. [2019-10-02 12:25:09,052 INFO L78 Accepts]: Start accepts. Automaton has 115058 states and 187795 transitions. Word has length 198 [2019-10-02 12:25:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:09,053 INFO L475 AbstractCegarLoop]: Abstraction has 115058 states and 187795 transitions. [2019-10-02 12:25:09,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:25:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 115058 states and 187795 transitions. [2019-10-02 12:25:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:25:09,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:09,122 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:09,123 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash 808897224, now seen corresponding path program 1 times [2019-10-02 12:25:09,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:09,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:25:09,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:25:09,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:25:10,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:10,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 3276 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:25:10,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:25:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:25:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:25:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:25:10,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:25:10,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:25:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:25:10,784 INFO L87 Difference]: Start difference. First operand 115058 states and 187795 transitions. Second operand 9 states. [2019-10-02 12:25:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:20,545 INFO L93 Difference]: Finished difference Result 231199 states and 383610 transitions. [2019-10-02 12:25:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:25:20,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 12:25:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:21,490 INFO L225 Difference]: With dead ends: 231199 [2019-10-02 12:25:21,490 INFO L226 Difference]: Without dead ends: 116458 [2019-10-02 12:25:21,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:25:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116458 states. [2019-10-02 12:25:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116458 to 116458. [2019-10-02 12:25:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116458 states. [2019-10-02 12:25:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116458 states to 116458 states and 188867 transitions. [2019-10-02 12:25:28,201 INFO L78 Accepts]: Start accepts. Automaton has 116458 states and 188867 transitions. Word has length 200 [2019-10-02 12:25:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:25:28,202 INFO L475 AbstractCegarLoop]: Abstraction has 116458 states and 188867 transitions. [2019-10-02 12:25:28,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:25:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 116458 states and 188867 transitions. [2019-10-02 12:25:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 12:25:28,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:25:28,261 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:25:28,261 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:25:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:25:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash -529456308, now seen corresponding path program 1 times [2019-10-02 12:25:28,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:25:28,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:25:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:28,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:25:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:25:28,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:25:28,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:25:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:25:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:25:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:25:29,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:25:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:25:29,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:25:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:25:29,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:25:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:25:29,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:25:29,189 INFO L87 Difference]: Start difference. First operand 116458 states and 188867 transitions. Second operand 14 states. [2019-10-02 12:25:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:25:56,257 INFO L93 Difference]: Finished difference Result 315356 states and 526620 transitions. [2019-10-02 12:25:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:25:56,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2019-10-02 12:25:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:25:57,994 INFO L225 Difference]: With dead ends: 315356 [2019-10-02 12:25:57,995 INFO L226 Difference]: Without dead ends: 257079 [2019-10-02 12:25:58,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:25:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257079 states. [2019-10-02 12:26:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257079 to 255082. [2019-10-02 12:26:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255082 states. [2019-10-02 12:26:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255082 states to 255082 states and 422112 transitions. [2019-10-02 12:26:23,078 INFO L78 Accepts]: Start accepts. Automaton has 255082 states and 422112 transitions. Word has length 202 [2019-10-02 12:26:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:26:23,079 INFO L475 AbstractCegarLoop]: Abstraction has 255082 states and 422112 transitions. [2019-10-02 12:26:23,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:26:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 255082 states and 422112 transitions. [2019-10-02 12:26:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:26:23,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:26:23,172 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:26:23,172 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:26:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:26:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1488520703, now seen corresponding path program 1 times [2019-10-02 12:26:23,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:26:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:26:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:23,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:26:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:26:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:26:23,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:26:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:26:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:26:23,343 INFO L87 Difference]: Start difference. First operand 255082 states and 422112 transitions. Second operand 9 states. [2019-10-02 12:26:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:26:38,787 INFO L93 Difference]: Finished difference Result 371063 states and 610125 transitions. [2019-10-02 12:26:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:26:38,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2019-10-02 12:26:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:26:39,502 INFO L225 Difference]: With dead ends: 371063 [2019-10-02 12:26:39,502 INFO L226 Difference]: Without dead ends: 116190 [2019-10-02 12:26:40,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:26:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116190 states. [2019-10-02 12:26:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116190 to 116190. [2019-10-02 12:26:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116190 states. [2019-10-02 12:26:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116190 states to 116190 states and 188231 transitions. [2019-10-02 12:26:45,868 INFO L78 Accepts]: Start accepts. Automaton has 116190 states and 188231 transitions. Word has length 217 [2019-10-02 12:26:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:26:45,868 INFO L475 AbstractCegarLoop]: Abstraction has 116190 states and 188231 transitions. [2019-10-02 12:26:45,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:26:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 116190 states and 188231 transitions. [2019-10-02 12:26:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:26:45,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:26:45,887 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:26:45,887 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:26:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:26:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash 292694115, now seen corresponding path program 1 times [2019-10-02 12:26:45,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:26:45,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:26:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:45,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:26:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:26:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:26:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:26:46,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:26:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:26:46,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:26:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:26:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:26:46,063 INFO L87 Difference]: Start difference. First operand 116190 states and 188231 transitions. Second operand 6 states. [2019-10-02 12:27:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:27:10,619 INFO L93 Difference]: Finished difference Result 393544 states and 670594 transitions. [2019-10-02 12:27:10,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:27:10,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-02 12:27:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:27:12,731 INFO L225 Difference]: With dead ends: 393544 [2019-10-02 12:27:12,732 INFO L226 Difference]: Without dead ends: 277771 [2019-10-02 12:27:13,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:27:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277771 states. [2019-10-02 12:27:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277771 to 256654. [2019-10-02 12:27:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256654 states. [2019-10-02 12:27:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256654 states to 256654 states and 426747 transitions. [2019-10-02 12:27:35,753 INFO L78 Accepts]: Start accepts. Automaton has 256654 states and 426747 transitions. Word has length 211 [2019-10-02 12:27:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:27:35,754 INFO L475 AbstractCegarLoop]: Abstraction has 256654 states and 426747 transitions. [2019-10-02 12:27:35,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:27:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 256654 states and 426747 transitions. [2019-10-02 12:27:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:27:35,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:27:35,778 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:27:35,779 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:27:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:27:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash 688495065, now seen corresponding path program 1 times [2019-10-02 12:27:35,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:27:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:27:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:27:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:27:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:27:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:27:35,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:27:35,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:27:35,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:27:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:27:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:27:35,957 INFO L87 Difference]: Start difference. First operand 256654 states and 426747 transitions. Second operand 6 states. [2019-10-02 12:28:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:36,116 INFO L93 Difference]: Finished difference Result 903176 states and 1592250 transitions. [2019-10-02 12:28:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:28:36,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-02 12:28:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:40,857 INFO L225 Difference]: With dead ends: 903176 [2019-10-02 12:28:40,857 INFO L226 Difference]: Without dead ends: 647067 [2019-10-02 12:28:41,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:28:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647067 states. [2019-10-02 12:29:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647067 to 585550. [2019-10-02 12:29:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585550 states. [2019-10-02 12:29:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585550 states to 585550 states and 1007979 transitions. [2019-10-02 12:29:52,286 INFO L78 Accepts]: Start accepts. Automaton has 585550 states and 1007979 transitions. Word has length 212 [2019-10-02 12:29:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:52,287 INFO L475 AbstractCegarLoop]: Abstraction has 585550 states and 1007979 transitions. [2019-10-02 12:29:52,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:29:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 585550 states and 1007979 transitions. [2019-10-02 12:29:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:29:52,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:52,312 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:52,313 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1861278681, now seen corresponding path program 1 times [2019-10-02 12:29:52,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:52,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:52,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:29:52,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:52,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:29:52,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:29:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:29:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:29:52,488 INFO L87 Difference]: Start difference. First operand 585550 states and 1007979 transitions. Second operand 6 states.