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_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:19,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:19,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:19,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:19,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:19,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:19,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:19,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:19,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:19,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:19,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:19,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:19,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:19,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:19,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:19,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:19,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:19,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:19,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:19,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:19,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:19,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:19,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:19,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:19,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:19,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:19,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:19,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:19,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:19,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:19,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:19,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:19,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:19,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:19,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:19,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:19,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:19,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:19,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:19,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:19,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:19,933 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:19,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:19,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:19,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:19,967 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:19,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:19,968 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:19,968 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:19,968 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:19,968 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:19,969 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:19,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:19,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:19,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:19,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:19,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:19,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:19,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:19,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:19,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:19,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:19,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:19,974 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:19,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:19,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:19,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:19,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:19,975 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:19,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:19,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:19,976 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:20,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:20,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:20,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:20,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:20,054 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:20,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-09-10 02:31:20,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb0aa6d/088448ed303a4fa2bd6f5579b45e5c7e/FLAG42b956bc0 [2019-09-10 02:31:20,721 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:20,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-09-10 02:31:20,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb0aa6d/088448ed303a4fa2bd6f5579b45e5c7e/FLAG42b956bc0 [2019-09-10 02:31:20,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49fb0aa6d/088448ed303a4fa2bd6f5579b45e5c7e [2019-09-10 02:31:20,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:20,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:20,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:20,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:20,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:20,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:20" (1/1) ... [2019-09-10 02:31:20,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af350f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:20, skipping insertion in model container [2019-09-10 02:31:20,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:20" (1/1) ... [2019-09-10 02:31:20,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:21,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:21,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:21,775 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:21,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:21,980 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:21,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:21 WrapperNode [2019-09-10 02:31:21,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:21,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:21,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:21,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:21,995 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:21" (1/1) ... [2019-09-10 02:31:21,996 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:21" (1/1) ... [2019-09-10 02:31:22,027 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:21" (1/1) ... [2019-09-10 02:31:22,028 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:21" (1/1) ... [2019-09-10 02:31:22,088 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:21" (1/1) ... [2019-09-10 02:31:22,134 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:21" (1/1) ... [2019-09-10 02:31:22,144 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:21" (1/1) ... [2019-09-10 02:31:22,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:22,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:22,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:22,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:22,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:21" (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:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:22,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:22,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:22,231 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:22,235 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-09-10 02:31:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:31:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:22,240 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:22,241 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:22,250 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:22,251 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:22,252 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-09-10 02:31:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:22,256 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:22,256 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:22,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:22,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:22,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:24,799 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:24,799 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:24,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:24 BoogieIcfgContainer [2019-09-10 02:31:24,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:24,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:24,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:24,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:24,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:20" (1/3) ... [2019-09-10 02:31:24,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b5b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:24, skipping insertion in model container [2019-09-10 02:31:24,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:21" (2/3) ... [2019-09-10 02:31:24,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201b5b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:24, skipping insertion in model container [2019-09-10 02:31:24,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:24" (3/3) ... [2019-09-10 02:31:24,810 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2019-09-10 02:31:24,821 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:24,832 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:24,850 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:24,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:24,880 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:24,880 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:24,880 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:24,880 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:24,880 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:24,881 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:24,881 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-09-10 02:31:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:24,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:24,951 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] [2019-09-10 02:31:24,954 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 370351368, now seen corresponding path program 1 times [2019-09-10 02:31:24,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:25,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:25,705 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:25,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:25,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:25,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:25,740 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-09-10 02:31:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:25,992 INFO L93 Difference]: Finished difference Result 600 states and 957 transitions. [2019-09-10 02:31:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:25,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 02:31:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:26,030 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:31:26,031 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:31:26,036 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:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:31:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:31:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-09-10 02:31:26,166 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 133 [2019-09-10 02:31:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:26,166 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-09-10 02:31:26,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-09-10 02:31:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:31:26,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:26,179 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] [2019-09-10 02:31:26,180 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -743808276, now seen corresponding path program 1 times [2019-09-10 02:31:26,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:26,383 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:26,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:26,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:26,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:26,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:26,386 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-09-10 02:31:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:26,441 INFO L93 Difference]: Finished difference Result 591 states and 946 transitions. [2019-09-10 02:31:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:26,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 02:31:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:26,448 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:31:26,448 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:31:26,449 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:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:31:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:31:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-09-10 02:31:26,482 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 136 [2019-09-10 02:31:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:26,484 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-09-10 02:31:26,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-09-10 02:31:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:31:26,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:26,497 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] [2019-09-10 02:31:26,498 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1971987191, now seen corresponding path program 1 times [2019-09-10 02:31:26,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:26,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:26,677 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:26,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:26,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:26,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:26,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:26,679 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-09-10 02:31:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:26,731 INFO L93 Difference]: Finished difference Result 591 states and 945 transitions. [2019-09-10 02:31:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:26,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-10 02:31:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:26,736 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:31:26,737 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:31:26,737 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:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:31:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:31:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-09-10 02:31:26,759 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 137 [2019-09-10 02:31:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:26,760 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-09-10 02:31:26,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-09-10 02:31:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:31:26,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:26,765 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] [2019-09-10 02:31:26,765 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1254078520, now seen corresponding path program 1 times [2019-09-10 02:31:26,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:26,948 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:26,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:26,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:26,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:26,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:26,950 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-09-10 02:31:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:26,995 INFO L93 Difference]: Finished difference Result 591 states and 944 transitions. [2019-09-10 02:31:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:26,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 02:31:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,000 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:31:27,000 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:31:27,001 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:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:31:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:31:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-09-10 02:31:27,020 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 138 [2019-09-10 02:31:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,021 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-09-10 02:31:27,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-09-10 02:31:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:31:27,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,026 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] [2019-09-10 02:31:27,026 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash 300720275, now seen corresponding path program 1 times [2019-09-10 02:31:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,144 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:27,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,147 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-09-10 02:31:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,194 INFO L93 Difference]: Finished difference Result 591 states and 943 transitions. [2019-09-10 02:31:27,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-10 02:31:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,201 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:31:27,201 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:31:27,201 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:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:31:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:31:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:31:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-09-10 02:31:27,225 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 139 [2019-09-10 02:31:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,225 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-09-10 02:31:27,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-09-10 02:31:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:27,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,230 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] [2019-09-10 02:31:27,231 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -261536604, now seen corresponding path program 1 times [2019-09-10 02:31:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,502 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:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:27,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:27,505 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-09-10 02:31:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,691 INFO L93 Difference]: Finished difference Result 598 states and 952 transitions. [2019-09-10 02:31:27,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:27,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 02:31:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,708 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:31:27,708 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:31:27,710 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:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:31:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-09-10 02:31:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:31:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-09-10 02:31:27,746 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-09-10 02:31:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,748 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-09-10 02:31:27,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-09-10 02:31:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:27,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,755 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] [2019-09-10 02:31:27,755 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 433110403, now seen corresponding path program 1 times [2019-09-10 02:31:27,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,920 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:27,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,922 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-09-10 02:31:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,969 INFO L93 Difference]: Finished difference Result 594 states and 945 transitions. [2019-09-10 02:31:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-10 02:31:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,975 INFO L225 Difference]: With dead ends: 594 [2019-09-10 02:31:27,975 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:31:27,976 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:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:31:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:31:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:31:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-09-10 02:31:27,999 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 140 [2019-09-10 02:31:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,999 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-09-10 02:31:28,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-09-10 02:31:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:31:28,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,004 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] [2019-09-10 02:31:28,004 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1772555127, now seen corresponding path program 1 times [2019-09-10 02:31:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,169 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:28,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:28,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:28,172 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-09-10 02:31:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,395 INFO L93 Difference]: Finished difference Result 586 states and 930 transitions. [2019-09-10 02:31:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:28,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:31:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,400 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:31:28,400 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:31:28,400 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:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:31:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:31:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:31:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-09-10 02:31:28,418 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 141 [2019-09-10 02:31:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,419 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-09-10 02:31:28,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-09-10 02:31:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:31:28,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,423 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] [2019-09-10 02:31:28,423 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -235226265, now seen corresponding path program 1 times [2019-09-10 02:31:28,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,553 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:28,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:28,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:28,555 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-09-10 02:31:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,792 INFO L93 Difference]: Finished difference Result 586 states and 926 transitions. [2019-09-10 02:31:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:28,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:31:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,797 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:31:28,797 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:31:28,798 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:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:31:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:31:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:31:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-09-10 02:31:28,816 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 142 [2019-09-10 02:31:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,816 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-09-10 02:31:28,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-09-10 02:31:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:31:28,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,821 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] [2019-09-10 02:31:28,821 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1655770492, now seen corresponding path program 1 times [2019-09-10 02:31:28,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,960 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:28,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:28,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:28,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:28,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:28,962 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-09-10 02:31:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,171 INFO L93 Difference]: Finished difference Result 586 states and 922 transitions. [2019-09-10 02:31:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:29,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 02:31:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,177 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:31:29,177 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:31:29,178 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:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:31:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:31:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:31:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-09-10 02:31:29,196 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 143 [2019-09-10 02:31:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,197 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-09-10 02:31:29,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-09-10 02:31:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:31:29,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,202 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] [2019-09-10 02:31:29,202 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1584723460, now seen corresponding path program 1 times [2019-09-10 02:31:29,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,374 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:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:29,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:29,377 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-09-10 02:31:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,458 INFO L93 Difference]: Finished difference Result 586 states and 918 transitions. [2019-09-10 02:31:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:29,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 02:31:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,463 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:31:29,463 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:31:29,465 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:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:31:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:31:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:31:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-09-10 02:31:29,492 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 143 [2019-09-10 02:31:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,492 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-09-10 02:31:29,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-09-10 02:31:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:31:29,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,497 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] [2019-09-10 02:31:29,497 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash -145161716, now seen corresponding path program 1 times [2019-09-10 02:31:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,626 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:29,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:29,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:29,629 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-09-10 02:31:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,734 INFO L93 Difference]: Finished difference Result 565 states and 884 transitions. [2019-09-10 02:31:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:29,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-10 02:31:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,740 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:31:29,740 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:31:29,741 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:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:31:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:31:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:31:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-09-10 02:31:29,767 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 144 [2019-09-10 02:31:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-09-10 02:31:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-09-10 02:31:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:31:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,820 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] [2019-09-10 02:31:29,820 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash -431774847, now seen corresponding path program 1 times [2019-09-10 02:31:29,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,941 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:29,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:29,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:29,944 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-09-10 02:31:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,045 INFO L93 Difference]: Finished difference Result 565 states and 883 transitions. [2019-09-10 02:31:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-10 02:31:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,051 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:31:30,051 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:31:30,051 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:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:31:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:31:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:31:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-09-10 02:31:30,073 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 145 [2019-09-10 02:31:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,075 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-09-10 02:31:30,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-09-10 02:31:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:31:30,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,080 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] [2019-09-10 02:31:30,080 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1019136847, now seen corresponding path program 1 times [2019-09-10 02:31:30,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,282 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:30,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:30,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:30,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:30,285 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 12 states. [2019-09-10 02:31:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,535 INFO L93 Difference]: Finished difference Result 566 states and 882 transitions. [2019-09-10 02:31:30,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:30,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 02:31:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,540 INFO L225 Difference]: With dead ends: 566 [2019-09-10 02:31:30,540 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:31:30,541 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:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:31:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:31:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:31:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-09-10 02:31:30,569 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 146 [2019-09-10 02:31:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,569 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-09-10 02:31:30,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-09-10 02:31:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:31:30,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,574 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] [2019-09-10 02:31:30,575 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1801631980, now seen corresponding path program 1 times [2019-09-10 02:31:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,719 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:31:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:30,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:31:30,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 02:31:30,726 INFO L207 CegarAbsIntRunner]: [55], [56], [140], [144], [147], [338], [340], [342], [407], [408], [410], [411], [412], [414], [417], [419], [423], [446], [846], [848], [867], [887], [907], [927], [947], [949], [978], [979], [980], [982], [991], [993], [1006], [1019], [1020], [1022], [1119], [1122], [1127], [1130], [1149], [1152], [1188], [1193], [1260], [1261], [1293], [1295], [1298], [1300], [1306], [1310], [1311], [1347], [1350], [1355], [1360], [1365], [1370], [1375], [1378], [1494], [1505], [1510], [1513], [1532], [1763], [1767], [1771], [1775], [1779], [1783], [1786], [1788], [1804], [1817], [1820], [1826], [1830], [1942], [1943], [2237], [2329], [2332], [2350], [2486], [2487], [2488], [2489], [2490], [2491], [2492], [2493], [2494], [2504], [2505], [2506], [2507], [2524], [2525], [2526], [2527], [2528], [2529], [2536], [2537], [2538], [2539], [2584], [2585], [2596], [2597], [2604], [2605], [2634], [2635], [2636], [2637], [2648], [2649], [2650], [2670], [2671], [2672], [2673], [2678], [2679], [2686], [2687], [2688], [2689], [2690], [2746], [2747], [2748] [2019-09-10 02:31:30,822 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:31:30,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:31:30,937 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:31:30,939 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 0. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-09-10 02:31:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,944 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:31:31,024 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:31:31,024 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:31:31,035 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-10 02:31:31,036 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:31:31,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:31:31,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:31:31,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:31:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:31:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:31:31,040 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 2 states. [2019-09-10 02:31:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,041 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:31:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:31:31,041 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-09-10 02:31:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,041 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:31:31,042 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:31:31,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:31:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:31:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:31:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:31:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:31:31,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-09-10 02:31:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,044 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:31:31,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:31:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:31:31,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:31:31,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:31:31 BoogieIcfgContainer [2019-09-10 02:31:31,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:31:31,053 INFO L168 Benchmark]: Toolchain (without parser) took 10097.56 ms. Allocated memory was 132.6 MB in the beginning and 398.5 MB in the end (delta: 265.8 MB). Free memory was 85.6 MB in the beginning and 91.5 MB in the end (delta: -5.9 MB). Peak memory consumption was 259.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,054 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1025.84 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.4 MB in the beginning and 141.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,056 INFO L168 Benchmark]: Boogie Preprocessor took 178.87 ms. Allocated memory is still 201.3 MB. Free memory was 141.2 MB in the beginning and 131.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,057 INFO L168 Benchmark]: RCFGBuilder took 2640.66 ms. Allocated memory was 201.3 MB in the beginning and 264.8 MB in the end (delta: 63.4 MB). Free memory was 131.9 MB in the beginning and 153.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,058 INFO L168 Benchmark]: TraceAbstraction took 6247.82 ms. Allocated memory was 264.8 MB in the beginning and 398.5 MB in the end (delta: 133.7 MB). Free memory was 153.6 MB in the beginning and 91.5 MB in the end (delta: 62.1 MB). Peak memory consumption was 195.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:31,062 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1025.84 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 85.4 MB in the beginning and 141.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.87 ms. Allocated memory is still 201.3 MB. Free memory was 141.2 MB in the beginning and 131.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2640.66 ms. Allocated memory was 201.3 MB in the beginning and 264.8 MB in the end (delta: 63.4 MB). Free memory was 131.9 MB in the beginning and 153.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6247.82 ms. Allocated memory was 264.8 MB in the beginning and 398.5 MB in the end (delta: 133.7 MB). Free memory was 153.6 MB in the beginning and 91.5 MB in the end (delta: 62.1 MB). Peak memory consumption was 195.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1212]: 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 76 procedures, 905 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12650 SDtfs, 440 SDslu, 48850 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6506849315068493 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2114 NumberOfCodeBlocks, 2114 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 356627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 264/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...