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_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:42,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:42,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:42,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:42,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:42,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:42,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:42,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:42,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:42,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:42,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:42,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:42,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:42,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:42,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:42,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:42,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:42,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:42,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:42,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:42,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:42,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:42,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:42,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:42,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:42,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:42,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:42,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:42,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:42,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:42,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:42,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:42,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:42,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:42,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:42,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:42,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:42,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:42,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:42,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:42,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:42,202 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:42,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:42,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:42,218 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:42,218 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:42,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:42,219 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:42,219 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:42,219 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:42,219 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:42,219 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:42,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:42,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:42,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:42,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:42,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:42,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:42,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:42,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:42,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:42,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:42,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:42,222 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:42,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:42,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:42,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:42,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:42,223 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:42,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:42,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:42,224 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:42,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:42,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:42,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:42,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:42,273 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:42,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-09-10 02:31:42,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020d9543/5c4206727f954140847b177e932a768d/FLAG44672e74d [2019-09-10 02:31:42,954 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:42,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-09-10 02:31:42,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020d9543/5c4206727f954140847b177e932a768d/FLAG44672e74d [2019-09-10 02:31:43,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020d9543/5c4206727f954140847b177e932a768d [2019-09-10 02:31:43,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:43,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:43,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:43,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:43,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:43,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:43" (1/1) ... [2019-09-10 02:31:43,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277c7fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:43, skipping insertion in model container [2019-09-10 02:31:43,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:43" (1/1) ... [2019-09-10 02:31:43,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:43,257 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:44,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:44,079 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:44,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:44,284 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:44,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:44 WrapperNode [2019-09-10 02:31:44,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:44,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:44,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:44,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:44,301 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:44" (1/1) ... [2019-09-10 02:31:44,301 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:44" (1/1) ... [2019-09-10 02:31:44,338 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:44" (1/1) ... [2019-09-10 02:31:44,339 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:44" (1/1) ... [2019-09-10 02:31:44,403 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:44" (1/1) ... [2019-09-10 02:31:44,437 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:44" (1/1) ... [2019-09-10 02:31:44,448 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:44" (1/1) ... [2019-09-10 02:31:44,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:44,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:44,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:44,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:44,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:44,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:44,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:44,580 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:44,580 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:44,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:44,582 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:44,586 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:44,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:31:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:44,587 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:31:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:44,588 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-10 02:31:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-10 02:31:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:31:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:31:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:44,592 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:44,592 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:44,592 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:44,593 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:44,593 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:44,593 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:44,593 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:44,593 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:44,594 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:44,594 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:44,594 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:44,595 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:44,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:44,595 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:44,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:44,596 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:44,597 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:44,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:44,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:44,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:44,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:44,602 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:31:44,607 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:31:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:44,608 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:44,609 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:31:44,611 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:44,612 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:31:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:44,613 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-10 02:31:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-10 02:31:44,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:44,620 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:44,621 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:44,622 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:44,628 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:46,996 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:46,997 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:46,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:46 BoogieIcfgContainer [2019-09-10 02:31:46,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:47,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:47,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:47,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:47,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:43" (1/3) ... [2019-09-10 02:31:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cad6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:47, skipping insertion in model container [2019-09-10 02:31:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:44" (2/3) ... [2019-09-10 02:31:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cad6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:47, skipping insertion in model container [2019-09-10 02:31:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:46" (3/3) ... [2019-09-10 02:31:47,007 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2019-09-10 02:31:47,018 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:47,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:47,051 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:47,089 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:47,090 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:47,090 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:47,090 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:47,090 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:47,090 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:47,090 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:47,091 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-09-10 02:31:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:31:47,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:47,181 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:47,186 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:47,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1311658421, now seen corresponding path program 1 times [2019-09-10 02:31:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:47,747 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:47,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:47,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:47,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:47,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:47,774 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-09-10 02:31:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,007 INFO L93 Difference]: Finished difference Result 661 states and 1041 transitions. [2019-09-10 02:31:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:48,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 02:31:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,046 INFO L225 Difference]: With dead ends: 661 [2019-09-10 02:31:48,046 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:48,048 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:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:31:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:31:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1029 transitions. [2019-09-10 02:31:48,192 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1029 transitions. Word has length 85 [2019-09-10 02:31:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,193 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1029 transitions. [2019-09-10 02:31:48,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2019-09-10 02:31:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:31:48,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:48,198 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:48,198 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1025593736, now seen corresponding path program 1 times [2019-09-10 02:31:48,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:48,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:48,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:48,393 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:48,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:48,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:48,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:48,399 INFO L87 Difference]: Start difference. First operand 650 states and 1029 transitions. Second operand 4 states. [2019-09-10 02:31:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,483 INFO L93 Difference]: Finished difference Result 652 states and 1030 transitions. [2019-09-10 02:31:48,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:48,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 02:31:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,499 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:31:48,499 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:48,500 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:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:31:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:31:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1028 transitions. [2019-09-10 02:31:48,566 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1028 transitions. Word has length 88 [2019-09-10 02:31:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,566 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1028 transitions. [2019-09-10 02:31:48,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1028 transitions. [2019-09-10 02:31:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:31:48,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:48,570 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:31:48,571 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1118647296, now seen corresponding path program 1 times [2019-09-10 02:31:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:48,707 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:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:48,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:48,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:48,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:48,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:48,709 INFO L87 Difference]: Start difference. First operand 650 states and 1028 transitions. Second operand 4 states. [2019-09-10 02:31:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,766 INFO L93 Difference]: Finished difference Result 652 states and 1029 transitions. [2019-09-10 02:31:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:48,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 02:31:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,772 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:31:48,773 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:48,773 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:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:31:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:31:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1027 transitions. [2019-09-10 02:31:48,805 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1027 transitions. Word has length 89 [2019-09-10 02:31:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,806 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1027 transitions. [2019-09-10 02:31:48,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1027 transitions. [2019-09-10 02:31:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:31:48,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:48,809 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:31:48,810 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -210310140, now seen corresponding path program 1 times [2019-09-10 02:31:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:49,026 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:49,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:49,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:49,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:49,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:49,028 INFO L87 Difference]: Start difference. First operand 650 states and 1027 transitions. Second operand 4 states. [2019-09-10 02:31:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:49,081 INFO L93 Difference]: Finished difference Result 652 states and 1028 transitions. [2019-09-10 02:31:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:49,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:31:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:49,087 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:31:49,087 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:49,088 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:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:31:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:31:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1026 transitions. [2019-09-10 02:31:49,148 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1026 transitions. Word has length 90 [2019-09-10 02:31:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:49,149 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1026 transitions. [2019-09-10 02:31:49,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1026 transitions. [2019-09-10 02:31:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:31:49,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:49,151 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:31:49,151 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1623031804, now seen corresponding path program 1 times [2019-09-10 02:31:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:49,251 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:49,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:49,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:49,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:49,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:49,253 INFO L87 Difference]: Start difference. First operand 650 states and 1026 transitions. Second operand 4 states. [2019-09-10 02:31:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:49,294 INFO L93 Difference]: Finished difference Result 652 states and 1027 transitions. [2019-09-10 02:31:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:49,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:31:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:49,300 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:31:49,300 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:49,300 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:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-10 02:31:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-10 02:31:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1025 transitions. [2019-09-10 02:31:49,324 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1025 transitions. Word has length 91 [2019-09-10 02:31:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:49,324 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1025 transitions. [2019-09-10 02:31:49,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1025 transitions. [2019-09-10 02:31:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:31:49,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:49,327 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:31:49,327 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1591560576, now seen corresponding path program 1 times [2019-09-10 02:31:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:49,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:49,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:49,512 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:49,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:49,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:49,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:49,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:49,514 INFO L87 Difference]: Start difference. First operand 650 states and 1025 transitions. Second operand 10 states. [2019-09-10 02:31:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:49,667 INFO L93 Difference]: Finished difference Result 659 states and 1036 transitions. [2019-09-10 02:31:49,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:49,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 02:31:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:49,675 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:31:49,675 INFO L226 Difference]: Without dead ends: 659 [2019-09-10 02:31:49,676 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:31:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-10 02:31:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2019-09-10 02:31:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:31:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-09-10 02:31:49,707 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-09-10 02:31:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:49,710 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-09-10 02:31:49,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-09-10 02:31:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:31:49,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:49,714 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:31:49,714 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:49,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1571223201, now seen corresponding path program 1 times [2019-09-10 02:31:49,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:49,808 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:49,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:49,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:49,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:49,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:49,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:49,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:49,810 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-09-10 02:31:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:49,855 INFO L93 Difference]: Finished difference Result 655 states and 1029 transitions. [2019-09-10 02:31:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:49,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:31:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:49,862 INFO L225 Difference]: With dead ends: 655 [2019-09-10 02:31:49,862 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 02:31:49,862 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:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 02:31:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-10 02:31:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 02:31:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1011 transitions. [2019-09-10 02:31:49,890 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1011 transitions. Word has length 92 [2019-09-10 02:31:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:49,890 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1011 transitions. [2019-09-10 02:31:49,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1011 transitions. [2019-09-10 02:31:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:31:49,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:49,894 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:31:49,894 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -120264268, now seen corresponding path program 1 times [2019-09-10 02:31:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:49,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:50,087 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:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:50,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:50,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:50,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:50,089 INFO L87 Difference]: Start difference. First operand 644 states and 1011 transitions. Second operand 6 states. [2019-09-10 02:31:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:50,316 INFO L93 Difference]: Finished difference Result 647 states and 1014 transitions. [2019-09-10 02:31:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:50,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 02:31:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:50,322 INFO L225 Difference]: With dead ends: 647 [2019-09-10 02:31:50,322 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 02:31:50,323 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:31:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 02:31:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-10 02:31:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 02:31:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1007 transitions. [2019-09-10 02:31:50,347 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1007 transitions. Word has length 93 [2019-09-10 02:31:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:50,347 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1007 transitions. [2019-09-10 02:31:50,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1007 transitions. [2019-09-10 02:31:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:31:50,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:50,350 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:31:50,351 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1667290269, now seen corresponding path program 1 times [2019-09-10 02:31:50,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:50,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:50,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:50,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:50,485 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:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:50,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:50,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:50,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:50,488 INFO L87 Difference]: Start difference. First operand 644 states and 1007 transitions. Second operand 6 states. [2019-09-10 02:31:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:50,691 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2019-09-10 02:31:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:50,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-10 02:31:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:50,697 INFO L225 Difference]: With dead ends: 647 [2019-09-10 02:31:50,697 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 02:31:50,698 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:31:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 02:31:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-10 02:31:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 02:31:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1003 transitions. [2019-09-10 02:31:50,719 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1003 transitions. Word has length 94 [2019-09-10 02:31:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:50,719 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1003 transitions. [2019-09-10 02:31:50,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1003 transitions. [2019-09-10 02:31:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:31:50,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:50,721 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:31:50,722 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1875714457, now seen corresponding path program 1 times [2019-09-10 02:31:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:50,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:50,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:50,854 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:50,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:50,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:50,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:50,855 INFO L87 Difference]: Start difference. First operand 644 states and 1003 transitions. Second operand 6 states. [2019-09-10 02:31:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:51,031 INFO L93 Difference]: Finished difference Result 647 states and 1006 transitions. [2019-09-10 02:31:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:51,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:31:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:51,037 INFO L225 Difference]: With dead ends: 647 [2019-09-10 02:31:51,037 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 02:31:51,038 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:31:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 02:31:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-10 02:31:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 02:31:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 999 transitions. [2019-09-10 02:31:51,061 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 999 transitions. Word has length 95 [2019-09-10 02:31:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:51,061 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 999 transitions. [2019-09-10 02:31:51,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 999 transitions. [2019-09-10 02:31:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:31:51,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:51,063 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:31:51,064 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1371398631, now seen corresponding path program 1 times [2019-09-10 02:31:51,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:51,243 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:51,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:51,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:51,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:51,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:51,245 INFO L87 Difference]: Start difference. First operand 644 states and 999 transitions. Second operand 7 states. [2019-09-10 02:31:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:51,334 INFO L93 Difference]: Finished difference Result 647 states and 1002 transitions. [2019-09-10 02:31:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:51,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 02:31:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:51,340 INFO L225 Difference]: With dead ends: 647 [2019-09-10 02:31:51,340 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:31:51,341 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:31:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:31:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:31:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:31:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 965 transitions. [2019-09-10 02:31:51,374 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 965 transitions. Word has length 95 [2019-09-10 02:31:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:51,374 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 965 transitions. [2019-09-10 02:31:51,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 965 transitions. [2019-09-10 02:31:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:31:51,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:51,377 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:31:51,377 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash 914472, now seen corresponding path program 1 times [2019-09-10 02:31:51,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:51,504 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:51,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:51,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:51,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:51,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:51,506 INFO L87 Difference]: Start difference. First operand 623 states and 965 transitions. Second operand 6 states. [2019-09-10 02:31:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:51,598 INFO L93 Difference]: Finished difference Result 626 states and 968 transitions. [2019-09-10 02:31:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:51,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:31:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:51,603 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:31:51,603 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:31:51,603 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:31:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:31:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:31:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:31:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 964 transitions. [2019-09-10 02:31:51,622 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 964 transitions. Word has length 96 [2019-09-10 02:31:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:51,623 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 964 transitions. [2019-09-10 02:31:51,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 964 transitions. [2019-09-10 02:31:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:31:51,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:51,626 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:31:51,626 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860286, now seen corresponding path program 1 times [2019-09-10 02:31:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:51,771 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:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:51,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:51,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:51,773 INFO L87 Difference]: Start difference. First operand 623 states and 964 transitions. Second operand 6 states. [2019-09-10 02:31:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:51,909 INFO L93 Difference]: Finished difference Result 626 states and 967 transitions. [2019-09-10 02:31:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:51,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:31:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:51,914 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:31:51,915 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:31:51,915 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:31:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:31:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:31:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:31:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 963 transitions. [2019-09-10 02:31:51,934 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 963 transitions. Word has length 97 [2019-09-10 02:31:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:51,935 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 963 transitions. [2019-09-10 02:31:51,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 963 transitions. [2019-09-10 02:31:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:31:51,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:51,937 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:31:51,937 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1360125715, now seen corresponding path program 1 times [2019-09-10 02:31:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:52,096 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:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:52,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:52,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:52,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:52,098 INFO L87 Difference]: Start difference. First operand 623 states and 963 transitions. Second operand 12 states. [2019-09-10 02:31:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:52,315 INFO L93 Difference]: Finished difference Result 627 states and 966 transitions. [2019-09-10 02:31:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:52,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 02:31:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:52,321 INFO L225 Difference]: With dead ends: 627 [2019-09-10 02:31:52,321 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:31:52,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:31:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:31:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:31:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:31:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 962 transitions. [2019-09-10 02:31:52,348 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 962 transitions. Word has length 98 [2019-09-10 02:31:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:52,348 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 962 transitions. [2019-09-10 02:31:52,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 962 transitions. [2019-09-10 02:31:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:31:52,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:52,350 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:31:52,350 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 372702175, now seen corresponding path program 1 times [2019-09-10 02:31:52,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:52,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:52,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:52,600 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:52,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:52,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:52,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:52,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:52,602 INFO L87 Difference]: Start difference. First operand 623 states and 962 transitions. Second operand 6 states. [2019-09-10 02:31:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:56,508 INFO L93 Difference]: Finished difference Result 1290 states and 2043 transitions. [2019-09-10 02:31:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:56,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:31:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:56,524 INFO L225 Difference]: With dead ends: 1290 [2019-09-10 02:31:56,524 INFO L226 Difference]: Without dead ends: 1290 [2019-09-10 02:31:56,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-10 02:31:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1165. [2019-09-10 02:31:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-09-10 02:31:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1844 transitions. [2019-09-10 02:31:56,596 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1844 transitions. Word has length 99 [2019-09-10 02:31:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:56,596 INFO L475 AbstractCegarLoop]: Abstraction has 1165 states and 1844 transitions. [2019-09-10 02:31:56,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1844 transitions. [2019-09-10 02:31:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:31:56,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:56,604 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 02:31:56,604 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1606765813, now seen corresponding path program 1 times [2019-09-10 02:31:56,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:56,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:56,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:56,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:56,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:56,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:56,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:56,929 INFO L87 Difference]: Start difference. First operand 1165 states and 1844 transitions. Second operand 12 states. [2019-09-10 02:32:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:08,638 INFO L93 Difference]: Finished difference Result 2735 states and 4277 transitions. [2019-09-10 02:32:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:32:08,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-09-10 02:32:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:08,655 INFO L225 Difference]: With dead ends: 2735 [2019-09-10 02:32:08,655 INFO L226 Difference]: Without dead ends: 2735 [2019-09-10 02:32:08,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:32:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-09-10 02:32:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2677. [2019-09-10 02:32:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2019-09-10 02:32:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4197 transitions. [2019-09-10 02:32:08,746 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4197 transitions. Word has length 157 [2019-09-10 02:32:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:08,747 INFO L475 AbstractCegarLoop]: Abstraction has 2677 states and 4197 transitions. [2019-09-10 02:32:08,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:32:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4197 transitions. [2019-09-10 02:32:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:32:08,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:08,753 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 02:32:08,754 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1417866634, now seen corresponding path program 1 times [2019-09-10 02:32:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:08,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:08,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:32:08,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:32:08,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:32:08,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 02:32:08,893 INFO L207 CegarAbsIntRunner]: [213], [215], [217], [246], [265], [267], [270], [272], [276], [388], [390], [409], [429], [449], [469], [489], [491], [520], [521], [522], [524], [527], [532], [540], [543], [605], [606], [688], [689], [977], [978], [1051], [1055], [1058], [1093], [1095], [1096], [1110], [1111], [1113], [1122], [1124], [1137], [1150], [1155], [1156], [1157], [1162], [1228], [1230], [1233], [1235], [1241], [1245], [1246], [1282], [1285], [1290], [1295], [1300], [1305], [1310], [1313], [1429], [1438], [1443], [1446], [1465], [1654], [1658], [1662], [1666], [1670], [1674], [1677], [1679], [1680], [1693], [1696], [1702], [1706], [2263], [2267], [2270], [2288], [2380], [2382], [2479], [2482], [2487], [2490], [2508], [2523], [2524], [2525], [2526], [2559], [2560], [2561], [2562], [2587], [2588], [2599], [2600], [2601], [2602], [2605], [2606], [2607], [2771], [2772], [2773], [2774], [2775], [2776], [2777], [2778], [2779], [2785], [2786], [2791], [2792], [2793], [2794], [2795], [2796], [2807], [2808], [2809], [2810], [2815], [2816], [2823], [2824], [2825], [2826], [2827], [2859], [2860], [2861], [2875], [2876], [2905], [2906], [2907], [2908] [2019-09-10 02:32:08,945 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:32:08,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:32:09,050 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:32:09,052 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 191 root evaluator evaluations with a maximum evaluation depth of 0. Performed 191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-09-10 02:32:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:09,057 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:32:09,119 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:32:09,119 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:32:09,124 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-09-10 02:32:09,125 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:32:09,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:32:09,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:32:09,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:09,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:32:09,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:32:09,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:32:09,127 INFO L87 Difference]: Start difference. First operand 2677 states and 4197 transitions. Second operand 2 states. [2019-09-10 02:32:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:09,128 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:32:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:32:09,128 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-10 02:32:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:09,128 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:32:09,129 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:32:09,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:32:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:32:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:32:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:32:09,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-09-10 02:32:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:09,130 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:32:09,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:32:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:32:09,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:32:09,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:32:09 BoogieIcfgContainer [2019-09-10 02:32:09,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:32:09,138 INFO L168 Benchmark]: Toolchain (without parser) took 25992.69 ms. Allocated memory was 139.5 MB in the beginning and 629.1 MB in the end (delta: 489.7 MB). Free memory was 83.3 MB in the beginning and 193.7 MB in the end (delta: -110.4 MB). Peak memory consumption was 379.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:09,139 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:32:09,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1135.69 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 83.3 MB in the beginning and 141.9 MB in the end (delta: -58.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:09,141 INFO L168 Benchmark]: Boogie Preprocessor took 192.62 ms. Allocated memory is still 201.9 MB. Free memory was 141.9 MB in the beginning and 131.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:09,142 INFO L168 Benchmark]: RCFGBuilder took 2519.69 ms. Allocated memory was 201.9 MB in the beginning and 266.3 MB in the end (delta: 64.5 MB). Free memory was 131.9 MB in the beginning and 146.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:09,143 INFO L168 Benchmark]: TraceAbstraction took 22136.04 ms. Allocated memory was 266.3 MB in the beginning and 629.1 MB in the end (delta: 362.8 MB). Free memory was 146.9 MB in the beginning and 193.7 MB in the end (delta: -46.8 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:09,146 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.25 ms. Allocated memory is still 139.5 MB. Free memory is still 104.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1135.69 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 83.3 MB in the beginning and 141.9 MB in the end (delta: -58.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.62 ms. Allocated memory is still 201.9 MB. Free memory was 141.9 MB in the beginning and 131.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2519.69 ms. Allocated memory was 201.9 MB in the beginning and 266.3 MB in the end (delta: 64.5 MB). Free memory was 131.9 MB in the beginning and 146.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22136.04 ms. Allocated memory was 266.3 MB in the beginning and 629.1 MB in the end (delta: 362.8 MB). Free memory was 146.9 MB in the beginning and 193.7 MB in the end (delta: -46.8 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3072]: 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 82 procedures, 956 locations, 1 error locations. SAFE Result, 22.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16471 SDtfs, 5136 SDslu, 55441 SDs, 0 SdLazy, 16906 SolverSat, 1711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2677occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.605095541401274 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 185 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 256558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...