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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:44:42,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:44:42,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:44:42,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:44:42,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:44:42,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:44:42,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:44:42,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:44:42,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:44:42,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:44:42,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:44:42,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:44:42,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:44:42,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:44:42,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:44:42,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:44:42,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:44:42,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:44:42,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:44:42,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:44:42,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:44:42,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:44:42,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:44:42,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:44:42,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:44:42,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:44:42,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:44:42,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:44:42,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:44:42,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:44:42,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:44:42,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:44:42,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:44:42,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:44:42,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:44:42,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:44:42,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:44:42,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:44:42,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:44:42,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:44:42,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:44:42,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:44:42,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:44:42,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:44:42,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:44:42,240 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:44:42,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:44:42,241 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:44:42,241 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:44:42,242 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:44:42,242 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:44:42,242 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:44:42,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:44:42,243 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:44:42,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:44:42,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:44:42,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:44:42,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:44:42,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:44:42,244 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:44:42,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:44:42,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:44:42,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:44:42,245 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:44:42,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:44:42,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:44:42,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:44:42,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:44:42,246 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:44:42,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:44:42,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:44:42,247 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:44:42,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:44:42,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:44:42,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:44:42,298 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:44:42,299 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:44:42,300 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-03 02:44:42,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86e779ea/415dc20bbad54537a870a5317b2590c3/FLAGddab8f4b4 [2019-10-03 02:44:43,000 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:44:43,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-03 02:44:43,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86e779ea/415dc20bbad54537a870a5317b2590c3/FLAGddab8f4b4 [2019-10-03 02:44:43,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86e779ea/415dc20bbad54537a870a5317b2590c3 [2019-10-03 02:44:43,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:44:43,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:44:43,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:43,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:44:43,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:44:43,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:43" (1/1) ... [2019-10-03 02:44:43,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f255249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:43, skipping insertion in model container [2019-10-03 02:44:43,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:43" (1/1) ... [2019-10-03 02:44:43,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:44:43,335 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:44:44,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:44,182 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:44:44,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:44,430 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:44:44,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44 WrapperNode [2019-10-03 02:44:44,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:44,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:44:44,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:44:44,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:44:44,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (1/1) ... [2019-10-03 02:44:44,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:44:44,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:44:44,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:44:44,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:44:44,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (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-03 02:44:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:44:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:44:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:44:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:44:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:44:44,749 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:44:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:44,750 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:44:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:44:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:44:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:44:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:44:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:44:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:44:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-03 02:44:44,755 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-03 02:44:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:44:44,757 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:44:44,758 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:44:44,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:44:44,758 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:44:44,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:44:44,758 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-03 02:44:44,759 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-03 02:44:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-03 02:44:44,760 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-03 02:44:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:44:44,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-03 02:44:44,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:44:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:44:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-03 02:44:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-03 02:44:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:44:44,766 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-03 02:44:44,766 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-03 02:44:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:44:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:44:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:44:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:44:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:44:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:44:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:44:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:44:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:44:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:44:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:44:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:44:44,772 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:44:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:44:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:44:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:44:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:44:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:44:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:44:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:44:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:44:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:44:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:44:44,775 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:44:44,776 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:44:44,777 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:44:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:44:44,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:44:44,779 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:44:44,780 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-03 02:44:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-03 02:44:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-03 02:44:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-03 02:44:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-03 02:44:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:44:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:44:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:44:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-03 02:44:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-03 02:44:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-03 02:44:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-03 02:44:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-03 02:44:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-03 02:44:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-03 02:44:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:44:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:44:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:44:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:44:47,220 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:44:47,221 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:44:47,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:47 BoogieIcfgContainer [2019-10-03 02:44:47,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:44:47,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:44:47,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:44:47,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:44:47,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:44:43" (1/3) ... [2019-10-03 02:44:47,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44255e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:47, skipping insertion in model container [2019-10-03 02:44:47,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:44" (2/3) ... [2019-10-03 02:44:47,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44255e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:47, skipping insertion in model container [2019-10-03 02:44:47,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:47" (3/3) ... [2019-10-03 02:44:47,231 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.c [2019-10-03 02:44:47,241 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:44:47,257 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:44:47,277 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:44:47,319 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:44:47,320 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:44:47,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:44:47,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:44:47,320 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:44:47,321 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:44:47,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:44:47,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:44:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states. [2019-10-03 02:44:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:44:47,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:47,409 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-03 02:44:47,413 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1390055657, now seen corresponding path program 1 times [2019-10-03 02:44:47,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:47,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:48,202 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-03 02:44:48,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:48,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:48,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:48,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:48,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:48,232 INFO L87 Difference]: Start difference. First operand 926 states. Second operand 6 states. [2019-10-03 02:44:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:48,458 INFO L93 Difference]: Finished difference Result 771 states and 1186 transitions. [2019-10-03 02:44:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:48,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-03 02:44:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:48,491 INFO L225 Difference]: With dead ends: 771 [2019-10-03 02:44:48,492 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:48,494 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-03 02:44:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1165 transitions. [2019-10-03 02:44:48,634 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1165 transitions. Word has length 119 [2019-10-03 02:44:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:48,637 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1165 transitions. [2019-10-03 02:44:48,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1165 transitions. [2019-10-03 02:44:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:44:48,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:48,644 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-03 02:44:48,644 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -232939241, now seen corresponding path program 1 times [2019-10-03 02:44:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:48,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:48,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:48,870 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-03 02:44:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:48,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:48,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:48,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:48,874 INFO L87 Difference]: Start difference. First operand 754 states and 1165 transitions. Second operand 4 states. [2019-10-03 02:44:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:48,950 INFO L93 Difference]: Finished difference Result 756 states and 1166 transitions. [2019-10-03 02:44:48,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:48,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-03 02:44:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:48,961 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:48,962 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:48,963 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-03 02:44:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1164 transitions. [2019-10-03 02:44:49,005 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1164 transitions. Word has length 122 [2019-10-03 02:44:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:49,006 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1164 transitions. [2019-10-03 02:44:49,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1164 transitions. [2019-10-03 02:44:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-03 02:44:49,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:49,009 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-03 02:44:49,010 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1715522467, now seen corresponding path program 1 times [2019-10-03 02:44:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:49,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:49,176 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-03 02:44:49,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:49,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:49,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:49,178 INFO L87 Difference]: Start difference. First operand 754 states and 1164 transitions. Second operand 4 states. [2019-10-03 02:44:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:49,275 INFO L93 Difference]: Finished difference Result 756 states and 1165 transitions. [2019-10-03 02:44:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:49,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-03 02:44:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:49,282 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:49,282 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:49,283 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-03 02:44:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1163 transitions. [2019-10-03 02:44:49,313 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1163 transitions. Word has length 123 [2019-10-03 02:44:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:49,314 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1163 transitions. [2019-10-03 02:44:49,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1163 transitions. [2019-10-03 02:44:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-03 02:44:49,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:49,317 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-03 02:44:49,318 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1903026157, now seen corresponding path program 1 times [2019-10-03 02:44:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:49,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:49,447 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-03 02:44:49,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:49,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:49,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:49,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:49,449 INFO L87 Difference]: Start difference. First operand 754 states and 1163 transitions. Second operand 4 states. [2019-10-03 02:44:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:49,510 INFO L93 Difference]: Finished difference Result 756 states and 1164 transitions. [2019-10-03 02:44:49,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:49,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-03 02:44:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:49,518 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:49,518 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:49,519 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-03 02:44:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1162 transitions. [2019-10-03 02:44:49,549 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1162 transitions. Word has length 124 [2019-10-03 02:44:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:49,551 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1162 transitions. [2019-10-03 02:44:49,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1162 transitions. [2019-10-03 02:44:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-03 02:44:49,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:49,555 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-03 02:44:49,555 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2005235937, now seen corresponding path program 1 times [2019-10-03 02:44:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:49,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:49,701 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-03 02:44:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:49,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:49,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:49,705 INFO L87 Difference]: Start difference. First operand 754 states and 1162 transitions. Second operand 4 states. [2019-10-03 02:44:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:49,757 INFO L93 Difference]: Finished difference Result 756 states and 1163 transitions. [2019-10-03 02:44:49,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:49,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-03 02:44:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:49,772 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:49,773 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:49,773 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-03 02:44:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1161 transitions. [2019-10-03 02:44:49,801 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1161 transitions. Word has length 125 [2019-10-03 02:44:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:49,801 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1161 transitions. [2019-10-03 02:44:49,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1161 transitions. [2019-10-03 02:44:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-03 02:44:49,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:49,806 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-03 02:44:49,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:49,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash -475123953, now seen corresponding path program 1 times [2019-10-03 02:44:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:49,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:49,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:49,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:49,968 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-03 02:44:49,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:49,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:49,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:49,970 INFO L87 Difference]: Start difference. First operand 754 states and 1161 transitions. Second operand 4 states. [2019-10-03 02:44:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:50,025 INFO L93 Difference]: Finished difference Result 756 states and 1162 transitions. [2019-10-03 02:44:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-03 02:44:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:50,032 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:50,033 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:50,033 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-03 02:44:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1160 transitions. [2019-10-03 02:44:50,065 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1160 transitions. Word has length 126 [2019-10-03 02:44:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:50,066 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1160 transitions. [2019-10-03 02:44:50,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1160 transitions. [2019-10-03 02:44:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 02:44:50,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:50,069 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-03 02:44:50,070 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 218267130, now seen corresponding path program 1 times [2019-10-03 02:44:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:50,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:50,281 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-03 02:44:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:50,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:50,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:50,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:50,283 INFO L87 Difference]: Start difference. First operand 754 states and 1160 transitions. Second operand 4 states. [2019-10-03 02:44:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:50,332 INFO L93 Difference]: Finished difference Result 756 states and 1161 transitions. [2019-10-03 02:44:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:50,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-03 02:44:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:50,338 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:44:50,338 INFO L226 Difference]: Without dead ends: 754 [2019-10-03 02:44:50,338 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-03 02:44:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-03 02:44:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-03 02:44:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-03 02:44:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1159 transitions. [2019-10-03 02:44:50,362 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1159 transitions. Word has length 127 [2019-10-03 02:44:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:50,364 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1159 transitions. [2019-10-03 02:44:50,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1159 transitions. [2019-10-03 02:44:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 02:44:50,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:50,366 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-03 02:44:50,370 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash 117355163, now seen corresponding path program 1 times [2019-10-03 02:44:50,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:50,556 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-03 02:44:50,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:50,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:44:50,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:50,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:44:50,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:44:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:44:50,560 INFO L87 Difference]: Start difference. First operand 754 states and 1159 transitions. Second operand 9 states. [2019-10-03 02:44:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:50,962 INFO L93 Difference]: Finished difference Result 757 states and 1162 transitions. [2019-10-03 02:44:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:44:50,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-10-03 02:44:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:50,970 INFO L225 Difference]: With dead ends: 757 [2019-10-03 02:44:50,970 INFO L226 Difference]: Without dead ends: 748 [2019-10-03 02:44:50,970 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-03 02:44:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-03 02:44:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-03 02:44:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-03 02:44:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1146 transitions. [2019-10-03 02:44:50,997 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1146 transitions. Word has length 127 [2019-10-03 02:44:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:50,997 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1146 transitions. [2019-10-03 02:44:50,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:44:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1146 transitions. [2019-10-03 02:44:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:44:51,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:51,001 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-03 02:44:51,001 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108187, now seen corresponding path program 1 times [2019-10-03 02:44:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:51,128 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-03 02:44:51,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:51,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:51,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:51,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:51,130 INFO L87 Difference]: Start difference. First operand 748 states and 1146 transitions. Second operand 6 states. [2019-10-03 02:44:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:51,346 INFO L93 Difference]: Finished difference Result 751 states and 1149 transitions. [2019-10-03 02:44:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:51,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-03 02:44:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:51,352 INFO L225 Difference]: With dead ends: 751 [2019-10-03 02:44:51,353 INFO L226 Difference]: Without dead ends: 748 [2019-10-03 02:44:51,353 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-03 02:44:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-03 02:44:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-03 02:44:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-03 02:44:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1142 transitions. [2019-10-03 02:44:51,378 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1142 transitions. Word has length 128 [2019-10-03 02:44:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:51,379 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1142 transitions. [2019-10-03 02:44:51,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1142 transitions. [2019-10-03 02:44:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 02:44:51,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:51,382 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-03 02:44:51,382 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1697144642, now seen corresponding path program 1 times [2019-10-03 02:44:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:51,559 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-03 02:44:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:51,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:51,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:51,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:51,561 INFO L87 Difference]: Start difference. First operand 748 states and 1142 transitions. Second operand 6 states. [2019-10-03 02:44:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:51,745 INFO L93 Difference]: Finished difference Result 751 states and 1145 transitions. [2019-10-03 02:44:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:51,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-03 02:44:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:51,751 INFO L225 Difference]: With dead ends: 751 [2019-10-03 02:44:51,752 INFO L226 Difference]: Without dead ends: 748 [2019-10-03 02:44:51,752 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-03 02:44:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-03 02:44:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-03 02:44:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-03 02:44:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1138 transitions. [2019-10-03 02:44:51,775 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1138 transitions. Word has length 129 [2019-10-03 02:44:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:51,776 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1138 transitions. [2019-10-03 02:44:51,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1138 transitions. [2019-10-03 02:44:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 02:44:51,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:51,779 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-03 02:44:51,779 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:51,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1882039414, now seen corresponding path program 1 times [2019-10-03 02:44:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:51,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:51,903 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-03 02:44:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:51,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:51,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:51,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:51,905 INFO L87 Difference]: Start difference. First operand 748 states and 1138 transitions. Second operand 6 states. [2019-10-03 02:44:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:52,145 INFO L93 Difference]: Finished difference Result 751 states and 1141 transitions. [2019-10-03 02:44:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:52,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-03 02:44:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:52,152 INFO L225 Difference]: With dead ends: 751 [2019-10-03 02:44:52,152 INFO L226 Difference]: Without dead ends: 748 [2019-10-03 02:44:52,154 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-03 02:44:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-03 02:44:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-03 02:44:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-03 02:44:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1134 transitions. [2019-10-03 02:44:52,182 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1134 transitions. Word has length 130 [2019-10-03 02:44:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:52,183 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1134 transitions. [2019-10-03 02:44:52,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1134 transitions. [2019-10-03 02:44:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 02:44:52,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:52,188 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-03 02:44:52,188 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1517623306, now seen corresponding path program 1 times [2019-10-03 02:44:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:52,378 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-03 02:44:52,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:52,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:52,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:52,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:52,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:52,382 INFO L87 Difference]: Start difference. First operand 748 states and 1134 transitions. Second operand 7 states. [2019-10-03 02:44:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:52,463 INFO L93 Difference]: Finished difference Result 751 states and 1137 transitions. [2019-10-03 02:44:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:44:52,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-03 02:44:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:52,469 INFO L225 Difference]: With dead ends: 751 [2019-10-03 02:44:52,470 INFO L226 Difference]: Without dead ends: 727 [2019-10-03 02:44:52,470 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-03 02:44:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-03 02:44:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-03 02:44:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-03 02:44:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1100 transitions. [2019-10-03 02:44:52,491 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1100 transitions. Word has length 130 [2019-10-03 02:44:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:52,491 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1100 transitions. [2019-10-03 02:44:52,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1100 transitions. [2019-10-03 02:44:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:44:52,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:52,494 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-03 02:44:52,494 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash -61574717, now seen corresponding path program 1 times [2019-10-03 02:44:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:52,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:52,640 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-03 02:44:52,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:52,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:52,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:52,643 INFO L87 Difference]: Start difference. First operand 727 states and 1100 transitions. Second operand 6 states. [2019-10-03 02:44:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:52,747 INFO L93 Difference]: Finished difference Result 730 states and 1103 transitions. [2019-10-03 02:44:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:52,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-03 02:44:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:52,757 INFO L225 Difference]: With dead ends: 730 [2019-10-03 02:44:52,757 INFO L226 Difference]: Without dead ends: 727 [2019-10-03 02:44:52,757 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-03 02:44:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-03 02:44:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-03 02:44:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-03 02:44:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1099 transitions. [2019-10-03 02:44:52,782 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1099 transitions. Word has length 131 [2019-10-03 02:44:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:52,783 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1099 transitions. [2019-10-03 02:44:52,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1099 transitions. [2019-10-03 02:44:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-03 02:44:52,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:52,803 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-03 02:44:52,803 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash -499475921, now seen corresponding path program 1 times [2019-10-03 02:44:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:52,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:52,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:52,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:52,940 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-03 02:44:52,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:52,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:52,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:52,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:52,942 INFO L87 Difference]: Start difference. First operand 727 states and 1099 transitions. Second operand 6 states. [2019-10-03 02:44:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:53,037 INFO L93 Difference]: Finished difference Result 730 states and 1102 transitions. [2019-10-03 02:44:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:53,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-03 02:44:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:53,044 INFO L225 Difference]: With dead ends: 730 [2019-10-03 02:44:53,044 INFO L226 Difference]: Without dead ends: 727 [2019-10-03 02:44:53,046 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-03 02:44:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-03 02:44:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-03 02:44:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-03 02:44:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1098 transitions. [2019-10-03 02:44:53,066 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1098 transitions. Word has length 132 [2019-10-03 02:44:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:53,067 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1098 transitions. [2019-10-03 02:44:53,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1098 transitions. [2019-10-03 02:44:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:44:53,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:53,072 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-03 02:44:53,073 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2067723976, now seen corresponding path program 1 times [2019-10-03 02:44:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:53,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:53,271 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-03 02:44:53,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:53,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:44:53,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:53,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:44:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:44:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:44:53,274 INFO L87 Difference]: Start difference. First operand 727 states and 1098 transitions. Second operand 11 states. [2019-10-03 02:44:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:53,793 INFO L93 Difference]: Finished difference Result 731 states and 1101 transitions. [2019-10-03 02:44:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:44:53,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-10-03 02:44:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:53,799 INFO L225 Difference]: With dead ends: 731 [2019-10-03 02:44:53,799 INFO L226 Difference]: Without dead ends: 727 [2019-10-03 02:44:53,801 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-03 02:44:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-03 02:44:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-03 02:44:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-03 02:44:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1097 transitions. [2019-10-03 02:44:53,821 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1097 transitions. Word has length 133 [2019-10-03 02:44:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:53,822 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1097 transitions. [2019-10-03 02:44:53,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:44:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1097 transitions. [2019-10-03 02:44:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:44:53,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:53,824 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-03 02:44:53,825 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1980443808, now seen corresponding path program 1 times [2019-10-03 02:44:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:53,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:53,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:53,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:53,949 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-03 02:44:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:53,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:53,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:53,951 INFO L87 Difference]: Start difference. First operand 727 states and 1097 transitions. Second operand 4 states. [2019-10-03 02:44:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:55,143 INFO L93 Difference]: Finished difference Result 1400 states and 2123 transitions. [2019-10-03 02:44:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:55,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-03 02:44:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:55,152 INFO L225 Difference]: With dead ends: 1400 [2019-10-03 02:44:55,152 INFO L226 Difference]: Without dead ends: 1400 [2019-10-03 02:44:55,153 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-03 02:44:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-10-03 02:44:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1387. [2019-10-03 02:44:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-03 02:44:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2107 transitions. [2019-10-03 02:44:55,235 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2107 transitions. Word has length 134 [2019-10-03 02:44:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:55,236 INFO L475 AbstractCegarLoop]: Abstraction has 1387 states and 2107 transitions. [2019-10-03 02:44:55,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2107 transitions. [2019-10-03 02:44:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:44:55,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:55,240 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-03 02:44:55,240 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1183400857, now seen corresponding path program 1 times [2019-10-03 02:44:55,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:55,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:55,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:55,478 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-03 02:44:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:55,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:55,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:55,480 INFO L87 Difference]: Start difference. First operand 1387 states and 2107 transitions. Second operand 6 states. [2019-10-03 02:45:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:00,244 INFO L93 Difference]: Finished difference Result 2838 states and 4478 transitions. [2019-10-03 02:45:00,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:00,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-03 02:45:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:00,268 INFO L225 Difference]: With dead ends: 2838 [2019-10-03 02:45:00,268 INFO L226 Difference]: Without dead ends: 2838 [2019-10-03 02:45:00,269 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-03 02:45:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-03 02:45:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2789. [2019-10-03 02:45:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-10-03 02:45:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4412 transitions. [2019-10-03 02:45:00,372 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4412 transitions. Word has length 135 [2019-10-03 02:45:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:00,373 INFO L475 AbstractCegarLoop]: Abstraction has 2789 states and 4412 transitions. [2019-10-03 02:45:00,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4412 transitions. [2019-10-03 02:45:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-03 02:45:00,384 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:00,385 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-03 02:45:00,385 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:00,385 INFO L82 PathProgramCache]: Analyzing trace with hash -185210926, now seen corresponding path program 1 times [2019-10-03 02:45:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:00,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:00,658 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-03 02:45:00,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:45:00,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:00,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:45:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:45:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:00,660 INFO L87 Difference]: Start difference. First operand 2789 states and 4412 transitions. Second operand 9 states. [2019-10-03 02:45:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:06,371 INFO L93 Difference]: Finished difference Result 2813 states and 4504 transitions. [2019-10-03 02:45:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:45:06,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-10-03 02:45:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:06,394 INFO L225 Difference]: With dead ends: 2813 [2019-10-03 02:45:06,394 INFO L226 Difference]: Without dead ends: 2813 [2019-10-03 02:45:06,395 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-03 02:45:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-10-03 02:45:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2805. [2019-10-03 02:45:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-10-03 02:45:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4492 transitions. [2019-10-03 02:45:06,498 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4492 transitions. Word has length 180 [2019-10-03 02:45:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:06,498 INFO L475 AbstractCegarLoop]: Abstraction has 2805 states and 4492 transitions. [2019-10-03 02:45:06,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4492 transitions. [2019-10-03 02:45:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 02:45:06,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:06,515 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-03 02:45:06,516 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash 748218603, now seen corresponding path program 1 times [2019-10-03 02:45:06,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:06,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:06,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:06,699 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-03 02:45:06,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:06,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:45:06,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:06,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:45:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:45:06,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:45:06,702 INFO L87 Difference]: Start difference. First operand 2805 states and 4492 transitions. Second operand 8 states. [2019-10-03 02:45:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:15,353 INFO L93 Difference]: Finished difference Result 7859 states and 12630 transitions. [2019-10-03 02:45:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:45:15,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-03 02:45:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:15,416 INFO L225 Difference]: With dead ends: 7859 [2019-10-03 02:45:15,417 INFO L226 Difference]: Without dead ends: 7859 [2019-10-03 02:45:15,417 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-03 02:45:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7859 states. [2019-10-03 02:45:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7859 to 7785. [2019-10-03 02:45:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7785 states. [2019-10-03 02:45:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 12512 transitions. [2019-10-03 02:45:15,732 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 12512 transitions. Word has length 181 [2019-10-03 02:45:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:15,732 INFO L475 AbstractCegarLoop]: Abstraction has 7785 states and 12512 transitions. [2019-10-03 02:45:15,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:45:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 12512 transitions. [2019-10-03 02:45:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:45:15,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:15,743 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-03 02:45:15,743 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:15,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1478649548, now seen corresponding path program 1 times [2019-10-03 02:45:15,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:15,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:15,911 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-03 02:45:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:15,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:15,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:15,913 INFO L87 Difference]: Start difference. First operand 7785 states and 12512 transitions. Second operand 4 states. [2019-10-03 02:45:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:17,133 INFO L93 Difference]: Finished difference Result 15070 states and 24224 transitions. [2019-10-03 02:45:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:17,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-10-03 02:45:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:17,223 INFO L225 Difference]: With dead ends: 15070 [2019-10-03 02:45:17,223 INFO L226 Difference]: Without dead ends: 15070 [2019-10-03 02:45:17,224 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-03 02:45:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15070 states. [2019-10-03 02:45:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15070 to 15057. [2019-10-03 02:45:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15057 states. [2019-10-03 02:45:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15057 states to 15057 states and 24208 transitions. [2019-10-03 02:45:17,683 INFO L78 Accepts]: Start accepts. Automaton has 15057 states and 24208 transitions. Word has length 185 [2019-10-03 02:45:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:17,683 INFO L475 AbstractCegarLoop]: Abstraction has 15057 states and 24208 transitions. [2019-10-03 02:45:17,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15057 states and 24208 transitions. [2019-10-03 02:45:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:45:17,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:17,700 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-03 02:45:17,700 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash 836436416, now seen corresponding path program 1 times [2019-10-03 02:45:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:17,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:17,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:18,513 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-03 02:45:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:18,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:18,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:18,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:18,515 INFO L87 Difference]: Start difference. First operand 15057 states and 24208 transitions. Second operand 6 states. [2019-10-03 02:45:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:19,403 INFO L93 Difference]: Finished difference Result 15105 states and 24232 transitions. [2019-10-03 02:45:19,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:19,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2019-10-03 02:45:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:19,502 INFO L225 Difference]: With dead ends: 15105 [2019-10-03 02:45:19,502 INFO L226 Difference]: Without dead ends: 15105 [2019-10-03 02:45:19,503 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-03 02:45:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15105 states. [2019-10-03 02:45:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15105 to 15105. [2019-10-03 02:45:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15105 states. [2019-10-03 02:45:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15105 states to 15105 states and 24232 transitions. [2019-10-03 02:45:20,053 INFO L78 Accepts]: Start accepts. Automaton has 15105 states and 24232 transitions. Word has length 185 [2019-10-03 02:45:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:20,053 INFO L475 AbstractCegarLoop]: Abstraction has 15105 states and 24232 transitions. [2019-10-03 02:45:20,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15105 states and 24232 transitions. [2019-10-03 02:45:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 02:45:20,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:20,076 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-03 02:45:20,076 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -36902761, now seen corresponding path program 1 times [2019-10-03 02:45:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:20,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:20,245 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-03 02:45:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:20,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:20,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:20,247 INFO L87 Difference]: Start difference. First operand 15105 states and 24232 transitions. Second operand 6 states. [2019-10-03 02:45:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:21,230 INFO L93 Difference]: Finished difference Result 15225 states and 24304 transitions. [2019-10-03 02:45:21,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:21,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-10-03 02:45:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:21,308 INFO L225 Difference]: With dead ends: 15225 [2019-10-03 02:45:21,308 INFO L226 Difference]: Without dead ends: 15225 [2019-10-03 02:45:21,309 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-03 02:45:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-10-03 02:45:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15225. [2019-10-03 02:45:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15225 states. [2019-10-03 02:45:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15225 states to 15225 states and 24304 transitions. [2019-10-03 02:45:21,713 INFO L78 Accepts]: Start accepts. Automaton has 15225 states and 24304 transitions. Word has length 186 [2019-10-03 02:45:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:21,713 INFO L475 AbstractCegarLoop]: Abstraction has 15225 states and 24304 transitions. [2019-10-03 02:45:21,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15225 states and 24304 transitions. [2019-10-03 02:45:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 02:45:21,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:21,730 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-03 02:45:21,731 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2106372179, now seen corresponding path program 1 times [2019-10-03 02:45:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:21,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:21,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:21,981 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-03 02:45:21,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:21,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:45:21,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:21,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:45:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:45:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:21,983 INFO L87 Difference]: Start difference. First operand 15225 states and 24304 transitions. Second operand 9 states. [2019-10-03 02:45:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:33,714 INFO L93 Difference]: Finished difference Result 35516 states and 59050 transitions. [2019-10-03 02:45:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:45:33,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2019-10-03 02:45:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:33,874 INFO L225 Difference]: With dead ends: 35516 [2019-10-03 02:45:33,874 INFO L226 Difference]: Without dead ends: 35516 [2019-10-03 02:45:33,875 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-03 02:45:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35516 states. [2019-10-03 02:45:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35516 to 33175. [2019-10-03 02:45:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33175 states. [2019-10-03 02:45:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33175 states to 33175 states and 54220 transitions. [2019-10-03 02:45:36,213 INFO L78 Accepts]: Start accepts. Automaton has 33175 states and 54220 transitions. Word has length 187 [2019-10-03 02:45:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 33175 states and 54220 transitions. [2019-10-03 02:45:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 33175 states and 54220 transitions. [2019-10-03 02:45:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 02:45:36,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:36,233 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-03 02:45:36,233 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1942282030, now seen corresponding path program 1 times [2019-10-03 02:45:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:36,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:36,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:36,435 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-03 02:45:36,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:36,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:45:36,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:36,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:45:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:45:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:45:36,440 INFO L87 Difference]: Start difference. First operand 33175 states and 54220 transitions. Second operand 11 states. [2019-10-03 02:45:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:45,984 INFO L93 Difference]: Finished difference Result 61016 states and 99804 transitions. [2019-10-03 02:45:45,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:45:45,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-03 02:45:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:46,319 INFO L225 Difference]: With dead ends: 61016 [2019-10-03 02:45:46,320 INFO L226 Difference]: Without dead ends: 60968 [2019-10-03 02:45:46,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:45:46,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60968 states. [2019-10-03 02:45:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60968 to 60211. [2019-10-03 02:45:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60211 states. [2019-10-03 02:45:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60211 states to 60211 states and 98340 transitions. [2019-10-03 02:45:47,812 INFO L78 Accepts]: Start accepts. Automaton has 60211 states and 98340 transitions. Word has length 187 [2019-10-03 02:45:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:47,813 INFO L475 AbstractCegarLoop]: Abstraction has 60211 states and 98340 transitions. [2019-10-03 02:45:47,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:45:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60211 states and 98340 transitions. [2019-10-03 02:45:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:45:47,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:47,842 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-03 02:45:47,842 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1949423258, now seen corresponding path program 1 times [2019-10-03 02:45:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:47,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:47,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:47,963 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-03 02:45:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:47,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:47,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:47,964 INFO L87 Difference]: Start difference. First operand 60211 states and 98340 transitions. Second operand 4 states. [2019-10-03 02:45:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:50,217 INFO L93 Difference]: Finished difference Result 113479 states and 186452 transitions. [2019-10-03 02:45:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:50,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-10-03 02:45:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:50,856 INFO L225 Difference]: With dead ends: 113479 [2019-10-03 02:45:50,857 INFO L226 Difference]: Without dead ends: 113479 [2019-10-03 02:45:50,857 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-03 02:45:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113479 states. [2019-10-03 02:45:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113479 to 113370. [2019-10-03 02:45:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113370 states. [2019-10-03 02:45:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113370 states to 113370 states and 186308 transitions. [2019-10-03 02:45:55,516 INFO L78 Accepts]: Start accepts. Automaton has 113370 states and 186308 transitions. Word has length 197 [2019-10-03 02:45:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:55,517 INFO L475 AbstractCegarLoop]: Abstraction has 113370 states and 186308 transitions. [2019-10-03 02:45:55,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 113370 states and 186308 transitions. [2019-10-03 02:45:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 02:45:55,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:55,546 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-03 02:45:55,547 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1923410824, now seen corresponding path program 1 times [2019-10-03 02:45:55,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:55,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:55,698 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-03 02:45:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:45:55,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:55,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:45:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:45:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:55,700 INFO L87 Difference]: Start difference. First operand 113370 states and 186308 transitions. Second operand 9 states. [2019-10-03 02:45:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:56,586 INFO L93 Difference]: Finished difference Result 115058 states and 189052 transitions. [2019-10-03 02:45:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:45:56,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-10-03 02:45:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:57,136 INFO L225 Difference]: With dead ends: 115058 [2019-10-03 02:45:57,136 INFO L226 Difference]: Without dead ends: 115058 [2019-10-03 02:45:57,136 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-03 02:45:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115058 states. [2019-10-03 02:46:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115058 to 113858. [2019-10-03 02:46:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113858 states. [2019-10-03 02:46:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113858 states to 113858 states and 186923 transitions. [2019-10-03 02:46:02,302 INFO L78 Accepts]: Start accepts. Automaton has 113858 states and 186923 transitions. Word has length 192 [2019-10-03 02:46:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,302 INFO L475 AbstractCegarLoop]: Abstraction has 113858 states and 186923 transitions. [2019-10-03 02:46:02,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:46:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 113858 states and 186923 transitions. [2019-10-03 02:46:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:46:02,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:02,316 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-03 02:46:02,316 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:02,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1599319028, now seen corresponding path program 1 times [2019-10-03 02:46:02,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:02,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:02,457 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-03 02:46:02,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:46:02,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:46:02,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2019-10-03 02:46:02,461 INFO L207 CegarAbsIntRunner]: [231], [233], [235], [269], [271], [273], [275], [277], [279], [280], [281], [284], [286], [290], [704], [706], [725], [745], [765], [785], [805], [807], [836], [837], [843], [846], [860], [1026], [1027], [1030], [1032], [1035], [1037], [1043], [1047], [1160], [1161], [1403], [1406], [1415], [1424], [1434], [1435], [1508], [1512], [1515], [1550], [1552], [1553], [1561], [1568], [1570], [1667], [1670], [1675], [1678], [1696], [1697], [1699], [1708], [1710], [1723], [1736], [1737], [1739], [1742], [1744], [1748], [1767], [1815], [1816], [1884], [1887], [1889], [1893], [1894], [1930], [1933], [1938], [1943], [1948], [1953], [1958], [1961], [2077], [2096], [2101], [2104], [2123], [2312], [2316], [2320], [2324], [2328], [2332], [2335], [2337], [2338], [2351], [2354], [2360], [2364], [2456], [2457], [2609], [2627], [2631], [2635], [2638], [2648], [2674], [2675], [2676], [2677], [2706], [2707], [2708], [2709], [2710], [2711], [2712], [2713], [2714], [2715], [2716], [2717], [2768], [2769], [2784], [2785], [2786], [2787], [2792], [2826], [2827], [2828], [2829], [2976], [2977], [2978], [2979], [2980], [2981], [2982], [2983], [2984], [2990], [2991], [2996], [2997], [2998], [2999], [3000], [3001], [3030], [3031], [3032], [3033], [3044], [3045], [3052], [3053], [3054], [3055], [3072], [3073], [3076], [3077], [3088], [3089], [3090], [3091], [3092], [3114], [3115], [3116] [2019-10-03 02:46:02,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:46:02,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:46:02,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:46:02,656 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 199 root evaluator evaluations with a maximum evaluation depth of 0. Performed 199 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 284 variables. [2019-10-03 02:46:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:02,661 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:46:02,741 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:46:02,742 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:46:02,747 INFO L420 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2019-10-03 02:46:02,747 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:46:02,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:46:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:46:02,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:02,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:46:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:46:02,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:02,750 INFO L87 Difference]: Start difference. First operand 113858 states and 186923 transitions. Second operand 2 states. [2019-10-03 02:46:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:02,751 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:46:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:46:02,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-10-03 02:46:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:02,751 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:46:02,751 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:46:02,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:46:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:46:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:46:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:46:02,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2019-10-03 02:46:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:02,753 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:46:02,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:46:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:46:02,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:46:02,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:46:02 BoogieIcfgContainer [2019-10-03 02:46:02,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:46:02,764 INFO L168 Benchmark]: Toolchain (without parser) took 79534.26 ms. Allocated memory was 137.9 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 82.5 MB in the beginning and 708.1 MB in the end (delta: -625.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,765 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1199.47 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 82.3 MB in the beginning and 126.2 MB in the end (delta: -43.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,767 INFO L168 Benchmark]: Boogie Preprocessor took 248.99 ms. Allocated memory is still 199.8 MB. Free memory was 126.2 MB in the beginning and 115.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,767 INFO L168 Benchmark]: RCFGBuilder took 2542.33 ms. Allocated memory was 199.8 MB in the beginning and 276.3 MB in the end (delta: 76.5 MB). Free memory was 115.8 MB in the beginning and 122.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,770 INFO L168 Benchmark]: TraceAbstraction took 75536.16 ms. Allocated memory was 276.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 122.7 MB in the beginning and 708.1 MB in the end (delta: -585.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-03 02:46:02,777 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1199.47 ms. Allocated memory was 137.9 MB in the beginning and 199.8 MB in the end (delta: 61.9 MB). Free memory was 82.3 MB in the beginning and 126.2 MB in the end (delta: -43.9 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.99 ms. Allocated memory is still 199.8 MB. Free memory was 126.2 MB in the beginning and 115.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2542.33 ms. Allocated memory was 199.8 MB in the beginning and 276.3 MB in the end (delta: 76.5 MB). Free memory was 115.8 MB in the beginning and 122.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75536.16 ms. Allocated memory was 276.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 122.7 MB in the beginning and 708.1 MB in the end (delta: -585.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 94 procedures, 1053 locations, 1 error locations. SAFE Result, 75.4s OverallTime, 27 OverallIterations, 5 TraceHistogramMax, 52.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33166 SDtfs, 25774 SDslu, 83340 SDs, 0 SdLazy, 37374 SolverSat, 5471 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113858occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.5076142131979695 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 4564 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 4053 NumberOfCodeBlocks, 4053 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4026 ConstructedInterpolants, 0 QuantifiedInterpolants, 908929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 840/848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...