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_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:54,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:54,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:54,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:54,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:54,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:54,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:54,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:54,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:54,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:54,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:54,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:54,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:54,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:54,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:54,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:54,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:54,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:54,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:54,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:54,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:54,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:54,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:54,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:54,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:54,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:54,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:54,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:54,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:54,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:54,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:54,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:54,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:54,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:54,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:54,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:54,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:54,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:54,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:54,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:54,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:54,213 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-09-10 02:31:54,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:54,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:54,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:54,228 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:54,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:54,229 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:54,229 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:54,229 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:54,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:54,230 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:54,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:54,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:54,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:54,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:54,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:54,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:54,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:54,232 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:54,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:54,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:54,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:54,233 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:54,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:54,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:54,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:54,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:54,234 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:54,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:54,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:54,234 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:54,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:54,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:54,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:54,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:54,283 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:54,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-09-10 02:31:54,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5e51580/416b60d5a8a645ce941ceccca7523d4f/FLAGe683f3fee [2019-09-10 02:31:54,976 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:54,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-09-10 02:31:55,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5e51580/416b60d5a8a645ce941ceccca7523d4f/FLAGe683f3fee [2019-09-10 02:31:55,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5e51580/416b60d5a8a645ce941ceccca7523d4f [2019-09-10 02:31:55,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:55,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:55,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:55,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:55,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:55,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:55" (1/1) ... [2019-09-10 02:31:55,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613a2159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:55, skipping insertion in model container [2019-09-10 02:31:55,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:55" (1/1) ... [2019-09-10 02:31:55,219 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:55,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:56,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:56,047 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:56,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:56,287 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:56,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56 WrapperNode [2019-09-10 02:31:56,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:56,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:56,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:56,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:56,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... [2019-09-10 02:31:56,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:56,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:56,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:56,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:56,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:56,602 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:56,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:56,602 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:56,602 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:56,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:31:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-09-10 02:31:56,606 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-09-10 02:31:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:56,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:56,609 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:56,612 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:56,620 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:56,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:58,802 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:58,802 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:58,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:58 BoogieIcfgContainer [2019-09-10 02:31:58,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:58,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:58,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:58,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:58,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:55" (1/3) ... [2019-09-10 02:31:58,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546bac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:58, skipping insertion in model container [2019-09-10 02:31:58,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:56" (2/3) ... [2019-09-10 02:31:58,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546bac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:58, skipping insertion in model container [2019-09-10 02:31:58,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:58" (3/3) ... [2019-09-10 02:31:58,813 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2019-09-10 02:31:58,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:58,835 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:58,852 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:58,886 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:58,886 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:58,886 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:58,886 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:58,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:58,887 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:58,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:58,887 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-10 02:31:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:31:58,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:58,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:58,973 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1815299235, now seen corresponding path program 1 times [2019-09-10 02:31:58,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:59,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:59,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:59,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:59,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:59,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:59,593 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-10 02:31:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:59,810 INFO L93 Difference]: Finished difference Result 618 states and 985 transitions. [2019-09-10 02:31:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:59,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 02:31:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:59,851 INFO L225 Difference]: With dead ends: 618 [2019-09-10 02:31:59,851 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:31:59,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:31:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:31:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:31:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 973 transitions. [2019-09-10 02:31:59,970 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 973 transitions. Word has length 85 [2019-09-10 02:31:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:59,971 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 973 transitions. [2019-09-10 02:31:59,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 973 transitions. [2019-09-10 02:31:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:31:59,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:59,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:59,979 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:59,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1195495049, now seen corresponding path program 1 times [2019-09-10 02:31:59,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:59,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:59,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:00,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:00,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:00,207 INFO L87 Difference]: Start difference. First operand 607 states and 973 transitions. Second operand 4 states. [2019-09-10 02:32:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:00,271 INFO L93 Difference]: Finished difference Result 609 states and 974 transitions. [2019-09-10 02:32:00,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:00,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 02:32:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:00,278 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:32:00,279 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:32:00,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:32:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:32:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:32:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-09-10 02:32:00,320 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 88 [2019-09-10 02:32:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:00,321 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-09-10 02:32:00,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-09-10 02:32:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:32:00,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:00,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:00,324 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash -709071794, now seen corresponding path program 1 times [2019-09-10 02:32:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:00,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:00,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:00,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:00,480 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 4 states. [2019-09-10 02:32:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:00,578 INFO L93 Difference]: Finished difference Result 609 states and 973 transitions. [2019-09-10 02:32:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:00,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 02:32:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:00,588 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:32:00,588 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:32:00,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:32:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:32:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:32:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 971 transitions. [2019-09-10 02:32:00,637 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 971 transitions. Word has length 89 [2019-09-10 02:32:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:00,637 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 971 transitions. [2019-09-10 02:32:00,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 971 transitions. [2019-09-10 02:32:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:32:00,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:00,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:00,642 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1566496723, now seen corresponding path program 1 times [2019-09-10 02:32:00,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:00,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:00,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:00,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:00,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:00,824 INFO L87 Difference]: Start difference. First operand 607 states and 971 transitions. Second operand 4 states. [2019-09-10 02:32:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:00,870 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2019-09-10 02:32:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:00,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:32:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:00,876 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:32:00,876 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:32:00,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:32:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:32:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:32:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 970 transitions. [2019-09-10 02:32:00,899 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 970 transitions. Word has length 90 [2019-09-10 02:32:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:00,900 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 970 transitions. [2019-09-10 02:32:00,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2019-09-10 02:32:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:32:00,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:00,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:00,903 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash -823973782, now seen corresponding path program 1 times [2019-09-10 02:32:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:00,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:01,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:01,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:01,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:01,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:01,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:01,006 INFO L87 Difference]: Start difference. First operand 607 states and 970 transitions. Second operand 4 states. [2019-09-10 02:32:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:01,050 INFO L93 Difference]: Finished difference Result 609 states and 971 transitions. [2019-09-10 02:32:01,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:01,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:32:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:01,056 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:32:01,057 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:32:01,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:32:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:32:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:32:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 969 transitions. [2019-09-10 02:32:01,082 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 969 transitions. Word has length 91 [2019-09-10 02:32:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:01,082 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 969 transitions. [2019-09-10 02:32:01,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 969 transitions. [2019-09-10 02:32:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:32:01,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:01,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:01,085 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1832765905, now seen corresponding path program 1 times [2019-09-10 02:32:01,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:01,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:01,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:32:01,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:01,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:32:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:32:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:01,298 INFO L87 Difference]: Start difference. First operand 607 states and 969 transitions. Second operand 10 states. [2019-09-10 02:32:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:01,456 INFO L93 Difference]: Finished difference Result 616 states and 980 transitions. [2019-09-10 02:32:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:32:01,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 02:32:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:01,462 INFO L225 Difference]: With dead ends: 616 [2019-09-10 02:32:01,462 INFO L226 Difference]: Without dead ends: 616 [2019-09-10 02:32:01,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:32:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-10 02:32:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-09-10 02:32:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:32:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 978 transitions. [2019-09-10 02:32:01,488 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 978 transitions. Word has length 92 [2019-09-10 02:32:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:01,489 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 978 transitions. [2019-09-10 02:32:01,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:32:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 978 transitions. [2019-09-10 02:32:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:32:01,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:01,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:01,492 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1812428530, now seen corresponding path program 1 times [2019-09-10 02:32:01,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:01,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:01,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:01,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:01,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:01,598 INFO L87 Difference]: Start difference. First operand 614 states and 978 transitions. Second operand 4 states. [2019-09-10 02:32:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:01,691 INFO L93 Difference]: Finished difference Result 612 states and 973 transitions. [2019-09-10 02:32:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:01,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:32:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:01,698 INFO L225 Difference]: With dead ends: 612 [2019-09-10 02:32:01,699 INFO L226 Difference]: Without dead ends: 601 [2019-09-10 02:32:01,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-10 02:32:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-10 02:32:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 02:32:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 955 transitions. [2019-09-10 02:32:01,724 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 955 transitions. Word has length 92 [2019-09-10 02:32:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:01,724 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 955 transitions. [2019-09-10 02:32:01,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 955 transitions. [2019-09-10 02:32:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:32:01,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:01,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:01,728 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1505086713, now seen corresponding path program 1 times [2019-09-10 02:32:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:01,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:01,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:01,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:01,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:01,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:01,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:01,908 INFO L87 Difference]: Start difference. First operand 601 states and 955 transitions. Second operand 6 states. [2019-09-10 02:32:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:02,134 INFO L93 Difference]: Finished difference Result 604 states and 958 transitions. [2019-09-10 02:32:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:02,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 02:32:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:02,142 INFO L225 Difference]: With dead ends: 604 [2019-09-10 02:32:02,142 INFO L226 Difference]: Without dead ends: 601 [2019-09-10 02:32:02,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-10 02:32:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-10 02:32:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 02:32:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 951 transitions. [2019-09-10 02:32:02,167 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 951 transitions. Word has length 93 [2019-09-10 02:32:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:02,169 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 951 transitions. [2019-09-10 02:32:02,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 951 transitions. [2019-09-10 02:32:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:32:02,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:02,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:02,175 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:02,176 INFO L82 PathProgramCache]: Analyzing trace with hash 150462354, now seen corresponding path program 1 times [2019-09-10 02:32:02,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:02,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:02,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:02,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:02,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:02,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:02,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:02,309 INFO L87 Difference]: Start difference. First operand 601 states and 951 transitions. Second operand 6 states. [2019-09-10 02:32:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:02,524 INFO L93 Difference]: Finished difference Result 604 states and 954 transitions. [2019-09-10 02:32:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:02,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-10 02:32:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:02,532 INFO L225 Difference]: With dead ends: 604 [2019-09-10 02:32:02,532 INFO L226 Difference]: Without dead ends: 601 [2019-09-10 02:32:02,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-10 02:32:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-10 02:32:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 02:32:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 947 transitions. [2019-09-10 02:32:02,562 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 947 transitions. Word has length 94 [2019-09-10 02:32:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:02,563 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 947 transitions. [2019-09-10 02:32:02,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 947 transitions. [2019-09-10 02:32:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:32:02,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:02,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:02,569 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -105920916, now seen corresponding path program 1 times [2019-09-10 02:32:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:02,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:02,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:02,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:02,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:02,762 INFO L87 Difference]: Start difference. First operand 601 states and 947 transitions. Second operand 6 states. [2019-09-10 02:32:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:02,942 INFO L93 Difference]: Finished difference Result 604 states and 950 transitions. [2019-09-10 02:32:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:02,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:32:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:02,948 INFO L225 Difference]: With dead ends: 604 [2019-09-10 02:32:02,948 INFO L226 Difference]: Without dead ends: 601 [2019-09-10 02:32:02,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-10 02:32:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-10 02:32:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-10 02:32:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 943 transitions. [2019-09-10 02:32:02,970 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 943 transitions. Word has length 95 [2019-09-10 02:32:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:02,970 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 943 transitions. [2019-09-10 02:32:02,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 943 transitions. [2019-09-10 02:32:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:32:02,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:02,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:02,973 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 941933292, now seen corresponding path program 1 times [2019-09-10 02:32:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:03,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:03,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:03,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:03,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:03,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:03,097 INFO L87 Difference]: Start difference. First operand 601 states and 943 transitions. Second operand 7 states. [2019-09-10 02:32:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:03,180 INFO L93 Difference]: Finished difference Result 604 states and 946 transitions. [2019-09-10 02:32:03,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:03,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 02:32:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:03,186 INFO L225 Difference]: With dead ends: 604 [2019-09-10 02:32:03,187 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 02:32:03,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 02:32:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 02:32:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 02:32:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 909 transitions. [2019-09-10 02:32:03,207 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 909 transitions. Word has length 95 [2019-09-10 02:32:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:03,208 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 909 transitions. [2019-09-10 02:32:03,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 909 transitions. [2019-09-10 02:32:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:32:03,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:03,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:03,211 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 497335511, now seen corresponding path program 1 times [2019-09-10 02:32:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:03,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:03,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:03,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:03,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:03,326 INFO L87 Difference]: Start difference. First operand 580 states and 909 transitions. Second operand 6 states. [2019-09-10 02:32:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:03,420 INFO L93 Difference]: Finished difference Result 583 states and 912 transitions. [2019-09-10 02:32:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:03,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:32:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:03,425 INFO L225 Difference]: With dead ends: 583 [2019-09-10 02:32:03,425 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 02:32:03,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 02:32:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 02:32:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 02:32:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 908 transitions. [2019-09-10 02:32:03,445 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 908 transitions. Word has length 96 [2019-09-10 02:32:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:03,447 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 908 transitions. [2019-09-10 02:32:03,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 908 transitions. [2019-09-10 02:32:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:32:03,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:03,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:03,449 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:03,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1979618769, now seen corresponding path program 1 times [2019-09-10 02:32:03,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:03,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:03,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:03,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:03,572 INFO L87 Difference]: Start difference. First operand 580 states and 908 transitions. Second operand 6 states. [2019-09-10 02:32:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:03,658 INFO L93 Difference]: Finished difference Result 583 states and 911 transitions. [2019-09-10 02:32:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:03,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:32:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:03,664 INFO L225 Difference]: With dead ends: 583 [2019-09-10 02:32:03,664 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 02:32:03,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 02:32:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 02:32:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 02:32:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 907 transitions. [2019-09-10 02:32:03,683 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 907 transitions. Word has length 97 [2019-09-10 02:32:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:03,684 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 907 transitions. [2019-09-10 02:32:03,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 907 transitions. [2019-09-10 02:32:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:32:03,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:03,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:03,686 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 646962716, now seen corresponding path program 1 times [2019-09-10 02:32:03,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:03,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:03,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:03,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:32:03,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:03,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:32:03,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:32:03,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:32:03,913 INFO L87 Difference]: Start difference. First operand 580 states and 907 transitions. Second operand 12 states. [2019-09-10 02:32:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:04,085 INFO L93 Difference]: Finished difference Result 584 states and 910 transitions. [2019-09-10 02:32:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:32:04,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 02:32:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:04,090 INFO L225 Difference]: With dead ends: 584 [2019-09-10 02:32:04,091 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 02:32:04,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:32:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 02:32:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-10 02:32:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-10 02:32:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 906 transitions. [2019-09-10 02:32:04,109 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 906 transitions. Word has length 98 [2019-09-10 02:32:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:04,109 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 906 transitions. [2019-09-10 02:32:04,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:32:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 906 transitions. [2019-09-10 02:32:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:32:04,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:04,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:04,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1922891352, now seen corresponding path program 1 times [2019-09-10 02:32:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:04,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:04,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:04,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:04,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:32:04,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:04,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:32:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:32:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:32:04,250 INFO L87 Difference]: Start difference. First operand 580 states and 906 transitions. Second operand 9 states. [2019-09-10 02:32:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,231 INFO L93 Difference]: Finished difference Result 1060 states and 1645 transitions. [2019-09-10 02:32:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:32:11,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 02:32:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,242 INFO L225 Difference]: With dead ends: 1060 [2019-09-10 02:32:11,242 INFO L226 Difference]: Without dead ends: 1060 [2019-09-10 02:32:11,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:32:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-09-10 02:32:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1028. [2019-09-10 02:32:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-09-10 02:32:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1603 transitions. [2019-09-10 02:32:11,288 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1603 transitions. Word has length 99 [2019-09-10 02:32:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:11,289 INFO L475 AbstractCegarLoop]: Abstraction has 1028 states and 1603 transitions. [2019-09-10 02:32:11,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:32:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1603 transitions. [2019-09-10 02:32:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:32:11,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:11,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:11,294 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1808185200, now seen corresponding path program 1 times [2019-09-10 02:32:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:11,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:32:11,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:32:11,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:32:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:11,473 INFO L87 Difference]: Start difference. First operand 1028 states and 1603 transitions. Second operand 5 states. [2019-09-10 02:32:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:13,679 INFO L93 Difference]: Finished difference Result 2125 states and 3410 transitions. [2019-09-10 02:32:13,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:13,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 02:32:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,702 INFO L225 Difference]: With dead ends: 2125 [2019-09-10 02:32:13,702 INFO L226 Difference]: Without dead ends: 2125 [2019-09-10 02:32:13,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-09-10 02:32:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2097. [2019-09-10 02:32:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-09-10 02:32:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3364 transitions. [2019-09-10 02:32:13,830 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3364 transitions. Word has length 100 [2019-09-10 02:32:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:13,831 INFO L475 AbstractCegarLoop]: Abstraction has 2097 states and 3364 transitions. [2019-09-10 02:32:13,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:32:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3364 transitions. [2019-09-10 02:32:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:32:13,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:13,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:13,835 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash -220478198, now seen corresponding path program 1 times [2019-09-10 02:32:13,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:14,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:14,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:14,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:14,065 INFO L87 Difference]: Start difference. First operand 2097 states and 3364 transitions. Second operand 4 states. [2019-09-10 02:32:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:16,224 INFO L93 Difference]: Finished difference Result 4496 states and 7480 transitions. [2019-09-10 02:32:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:16,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-10 02:32:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:16,254 INFO L225 Difference]: With dead ends: 4496 [2019-09-10 02:32:16,254 INFO L226 Difference]: Without dead ends: 4496 [2019-09-10 02:32:16,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2019-09-10 02:32:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4439. [2019-09-10 02:32:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-09-10 02:32:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7371 transitions. [2019-09-10 02:32:16,423 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7371 transitions. Word has length 101 [2019-09-10 02:32:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:16,424 INFO L475 AbstractCegarLoop]: Abstraction has 4439 states and 7371 transitions. [2019-09-10 02:32:16,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7371 transitions. [2019-09-10 02:32:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:32:16,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:16,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:16,426 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1753802514, now seen corresponding path program 1 times [2019-09-10 02:32:16,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:16,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:16,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:16,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:16,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:16,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:16,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:16,532 INFO L87 Difference]: Start difference. First operand 4439 states and 7371 transitions. Second operand 4 states. [2019-09-10 02:32:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:18,728 INFO L93 Difference]: Finished difference Result 9800 states and 17187 transitions. [2019-09-10 02:32:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:18,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 02:32:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:18,801 INFO L225 Difference]: With dead ends: 9800 [2019-09-10 02:32:18,801 INFO L226 Difference]: Without dead ends: 9800 [2019-09-10 02:32:18,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9800 states. [2019-09-10 02:32:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9800 to 9682. [2019-09-10 02:32:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-09-10 02:32:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 16883 transitions. [2019-09-10 02:32:19,229 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 16883 transitions. Word has length 102 [2019-09-10 02:32:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:19,229 INFO L475 AbstractCegarLoop]: Abstraction has 9682 states and 16883 transitions. [2019-09-10 02:32:19,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 16883 transitions. [2019-09-10 02:32:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:32:19,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:19,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:19,232 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1468000948, now seen corresponding path program 1 times [2019-09-10 02:32:19,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:19,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:19,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:19,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:19,345 INFO L87 Difference]: Start difference. First operand 9682 states and 16883 transitions. Second operand 4 states. [2019-09-10 02:32:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:21,658 INFO L93 Difference]: Finished difference Result 21960 states and 41674 transitions. [2019-09-10 02:32:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:21,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-10 02:32:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:21,859 INFO L225 Difference]: With dead ends: 21960 [2019-09-10 02:32:21,859 INFO L226 Difference]: Without dead ends: 21960 [2019-09-10 02:32:21,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2019-09-10 02:32:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 21709. [2019-09-10 02:32:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21709 states. [2019-09-10 02:32:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21709 states to 21709 states and 40667 transitions. [2019-09-10 02:32:23,530 INFO L78 Accepts]: Start accepts. Automaton has 21709 states and 40667 transitions. Word has length 103 [2019-09-10 02:32:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:23,531 INFO L475 AbstractCegarLoop]: Abstraction has 21709 states and 40667 transitions. [2019-09-10 02:32:23,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21709 states and 40667 transitions. [2019-09-10 02:32:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:32:23,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:23,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:23,534 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1735310740, now seen corresponding path program 1 times [2019-09-10 02:32:23,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:23,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:23,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:23,654 INFO L87 Difference]: Start difference. First operand 21709 states and 40667 transitions. Second operand 4 states. [2019-09-10 02:32:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:26,366 INFO L93 Difference]: Finished difference Result 50572 states and 107844 transitions. [2019-09-10 02:32:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:26,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 02:32:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:26,947 INFO L225 Difference]: With dead ends: 50572 [2019-09-10 02:32:26,947 INFO L226 Difference]: Without dead ends: 50560 [2019-09-10 02:32:26,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50560 states. [2019-09-10 02:32:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50560 to 50010. [2019-09-10 02:32:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50010 states. [2019-09-10 02:32:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50010 states to 50010 states and 103931 transitions. [2019-09-10 02:32:30,716 INFO L78 Accepts]: Start accepts. Automaton has 50010 states and 103931 transitions. Word has length 104 [2019-09-10 02:32:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:30,717 INFO L475 AbstractCegarLoop]: Abstraction has 50010 states and 103931 transitions. [2019-09-10 02:32:30,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50010 states and 103931 transitions. [2019-09-10 02:32:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 02:32:30,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:30,750 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:30,750 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash -851689544, now seen corresponding path program 1 times [2019-09-10 02:32:30,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:30,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:30,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:30,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:30,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 02:32:30,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:30,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:32:30,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:30,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:32:30,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:32:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:32:30,982 INFO L87 Difference]: Start difference. First operand 50010 states and 103931 transitions. Second operand 12 states. [2019-09-10 02:32:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:41,738 INFO L93 Difference]: Finished difference Result 89040 states and 188946 transitions. [2019-09-10 02:32:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:32:41,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-09-10 02:32:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:42,448 INFO L225 Difference]: With dead ends: 89040 [2019-09-10 02:32:42,448 INFO L226 Difference]: Without dead ends: 89040 [2019-09-10 02:32:42,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:32:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89040 states. [2019-09-10 02:32:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89040 to 88188. [2019-09-10 02:32:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88188 states. [2019-09-10 02:32:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88188 states to 88188 states and 186315 transitions. [2019-09-10 02:32:47,735 INFO L78 Accepts]: Start accepts. Automaton has 88188 states and 186315 transitions. Word has length 228 [2019-09-10 02:32:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:47,736 INFO L475 AbstractCegarLoop]: Abstraction has 88188 states and 186315 transitions. [2019-09-10 02:32:47,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:32:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 88188 states and 186315 transitions. [2019-09-10 02:32:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-10 02:32:47,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:47,761 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:47,761 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 492896005, now seen corresponding path program 1 times [2019-09-10 02:32:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:47,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-10 02:32:47,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:32:47,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:32:47,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2019-09-10 02:32:47,931 INFO L207 CegarAbsIntRunner]: [60], [61], [64], [67], [89], [140], [144], [147], [431], [433], [435], [467], [470], [471], [472], [803], [806], [835], [858], [928], [930], [933], [946], [969], [989], [1009], [1029], [1031], [1032], [1037], [1040], [1059], [1060], [1061], [1062], [1064], [1067], [1070], [1072], [1080], [1081], [1083], [1092], [1094], [1097], [1099], [1102], [1107], [1110], [1114], [1116], [1120], [1126], [1129], [1153], [1155], [1156], [1157], [1158], [1159], [1164], [1165], [1168], [1190], [1195], [1196], [1231], [1232], [1236], [1239], [1263], [1264], [1266], [1269], [1277], [1278], [1314], [1317], [1322], [1327], [1332], [1337], [1342], [1345], [1461], [1474], [1479], [1482], [1501], [1544], [1547], [1550], [1727], [1728], [1730], [1733], [1747], [1762], [1777], [1792], [1807], [1822], [1856], [1857], [1861], [1865], [1869], [1873], [1877], [1880], [1882], [2022], [2023], [2035], [2039], [2063], [2064], [2066], [2069], [2115], [2118], [2121], [2124], [2266], [2267], [2270], [2294], [2295], [2310], [2313], [2331], [2332], [2334], [2344], [2347], [2357], [2360], [2370], [2373], [2376], [2379], [2386], [2396], [2399], [2409], [2412], [2500], [2501], [2502], [2503], [2504], [2505], [2506], [2507], [2508], [2532], [2533], [2534], [2535], [2552], [2553], [2554], [2555], [2582], [2583], [2584], [2585], [2608], [2609], [2620], [2621], [2622], [2623], [2626], [2627], [2628], [2629], [2630], [2631], [2632], [2633], [2634], [2635], [2638], [2646], [2647], [2656], [2657], [2660], [2661], [2668], [2669], [2670], [2671], [2672], [2694], [2695], [2696], [2697], [2722], [2723], [2724], [2725], [2750], [2751], [2752], [2753], [2766], [2767], [2768], [2770], [2771], [2780], [2781], [2790], [2791], [2800], [2801], [2802], [2803], [2804], [2805], [2806], [2807], [2808], [2809], [2810], [2811], [2820], [2821], [2830], [2831] [2019-09-10 02:32:48,039 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:32:48,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:32:48,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:32:48,165 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 155 root evaluator evaluations with a maximum evaluation depth of 0. Performed 155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 268 variables. [2019-09-10 02:32:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:48,171 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:32:48,261 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:32:48,261 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:32:48,268 INFO L420 sIntCurrentIteration]: We unified 282 AI predicates to 282 [2019-09-10 02:32:48,268 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:32:48,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:32:48,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:32:48,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:48,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:32:48,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:32:48,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:32:48,270 INFO L87 Difference]: Start difference. First operand 88188 states and 186315 transitions. Second operand 2 states. [2019-09-10 02:32:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:48,271 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:32:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:32:48,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 283 [2019-09-10 02:32:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:48,271 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:32:48,272 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:32:48,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 282 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-09-10 02:32:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:32:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:32:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:32:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:32:48,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-09-10 02:32:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:48,275 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:32:48,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:32:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:32:48,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:32:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:32:48 BoogieIcfgContainer [2019-09-10 02:32:48,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:32:48,283 INFO L168 Benchmark]: Toolchain (without parser) took 53084.23 ms. Allocated memory was 135.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 88.5 MB in the beginning and 580.7 MB in the end (delta: -492.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,284 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1088.67 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 138.8 MB in the end (delta: -50.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,286 INFO L168 Benchmark]: Boogie Preprocessor took 227.93 ms. Allocated memory is still 201.9 MB. Free memory was 138.8 MB in the beginning and 129.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,287 INFO L168 Benchmark]: RCFGBuilder took 2283.94 ms. Allocated memory was 201.9 MB in the beginning and 256.9 MB in the end (delta: 55.1 MB). Free memory was 129.7 MB in the beginning and 136.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,288 INFO L168 Benchmark]: TraceAbstraction took 49476.13 ms. Allocated memory was 256.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 136.7 MB in the beginning and 580.7 MB in the end (delta: -444.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-10 02:32:48,292 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1088.67 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 138.8 MB in the end (delta: -50.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 227.93 ms. Allocated memory is still 201.9 MB. Free memory was 138.8 MB in the beginning and 129.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2283.94 ms. Allocated memory was 201.9 MB in the beginning and 256.9 MB in the end (delta: 55.1 MB). Free memory was 129.7 MB in the beginning and 136.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49476.13 ms. Allocated memory was 256.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 136.7 MB in the beginning and 580.7 MB in the end (delta: -444.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3309]: 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 77 procedures, 909 locations, 1 error locations. SAFE Result, 49.4s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 32.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20203 SDtfs, 15235 SDslu, 53924 SDs, 0 SdLazy, 24347 SolverSat, 4322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88188occurred in iteration=21, 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.2836879432624113 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1890 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2415 NumberOfCodeBlocks, 2415 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2393 ConstructedInterpolants, 0 QuantifiedInterpolants, 421165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 187/190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...