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_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:32:03,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:32:03,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:32:03,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:32:03,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:32:03,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:32:03,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:32:03,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:32:03,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:32:03,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:32:03,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:32:03,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:32:03,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:32:03,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:32:03,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:32:03,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:32:03,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:32:03,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:32:03,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:32:03,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:32:03,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:32:03,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:32:03,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:32:03,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:32:03,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:32:03,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:32:03,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:32:03,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:32:03,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:32:03,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:32:03,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:32:03,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:32:03,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:32:03,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:32:03,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:32:03,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:32:03,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:32:03,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:32:03,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:32:03,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:32:03,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:32:03,885 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:32:03,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:32:03,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:32:03,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:32:03,900 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:32:03,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:32:03,901 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:32:03,901 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:32:03,901 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:32:03,901 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:32:03,902 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:32:03,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:32:03,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:32:03,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:32:03,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:32:03,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:32:03,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:32:03,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:32:03,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:32:03,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:32:03,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:32:03,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:32:03,905 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:32:03,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:32:03,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:32:03,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:32:03,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:32:03,906 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:32:03,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:32:03,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:32:03,906 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:32:03,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:32:03,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:32:03,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:32:03,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:32:03,973 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:32:03,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-09-10 02:32:04,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8cf2f0/b051902735b54710b43a073282912336/FLAG02b87f684 [2019-09-10 02:32:04,662 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:32:04,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product27.cil.c [2019-09-10 02:32:04,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8cf2f0/b051902735b54710b43a073282912336/FLAG02b87f684 [2019-09-10 02:32:04,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b8cf2f0/b051902735b54710b43a073282912336 [2019-09-10 02:32:04,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:32:04,867 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:32:04,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:04,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:32:04,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:32:04,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:04" (1/1) ... [2019-09-10 02:32:04,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6767852d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:04, skipping insertion in model container [2019-09-10 02:32:04,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:04" (1/1) ... [2019-09-10 02:32:04,886 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:32:04,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:32:05,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:05,658 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:32:05,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:05,878 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:32:05,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05 WrapperNode [2019-09-10 02:32:05,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:05,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:32:05,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:32:05,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:32:05,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:05,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:05,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:05,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:05,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:06,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:06,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (1/1) ... [2019-09-10 02:32:06,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:32:06,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:32:06,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:32:06,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:32:06,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (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:32:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:32:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:32:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:06,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:32:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:32:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:32:06,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:06,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:06,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:06,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:06,135 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:32:06,135 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:32:06,136 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:32:06,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:32:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:32:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:32:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:32:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:32:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:32:06,138 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:32:06,139 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:06,139 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:32:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:32:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:32:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:32:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:32:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:32:06,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:32:06,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:32:06,142 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:32:06,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:32:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:32:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:32:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:32:06,143 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:32:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:32:06,144 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:32:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:32:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:32:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:32:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:32:06,145 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:32:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:32:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:32:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:32:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:32:06,146 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:32:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:32:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:32:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:32:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:32:06,147 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:32:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:32:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:32:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:32:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:32:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:32:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:32:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:32:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:32:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:32:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:32:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:32:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:32:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:32:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:32:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:32:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:32:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:32:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:32:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:32:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:32:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:32:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:32:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:32:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:32:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:32:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:32:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:32:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:32:06,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:32:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:32:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:32:06,157 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:32:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:32:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:32:06,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:32:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:32:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:32:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:32:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:32:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:32:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:32:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:32:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:32:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:32:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:32:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:32:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:32:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:32:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:32:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:32:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:32:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:32:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:32:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:32:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:32:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:32:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:32:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:32:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:32:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:32:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:32:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:32:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:32:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:32:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:32:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:32:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:32:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:32:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:32:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:32:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:32:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:32:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:32:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:32:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:32:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:32:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:32:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:32:06,183 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:32:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:32:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:32:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:32:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:32:06,184 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:32:06,185 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:32:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:32:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:32:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:32:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:32:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:32:06,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:32:08,513 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:32:08,514 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:32:08,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:08 BoogieIcfgContainer [2019-09-10 02:32:08,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:32:08,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:32:08,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:32:08,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:32:08,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:32:04" (1/3) ... [2019-09-10 02:32:08,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881527e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:08, skipping insertion in model container [2019-09-10 02:32:08,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:05" (2/3) ... [2019-09-10 02:32:08,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881527e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:08, skipping insertion in model container [2019-09-10 02:32:08,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:08" (3/3) ... [2019-09-10 02:32:08,524 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product27.cil.c [2019-09-10 02:32:08,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:32:08,545 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:32:08,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:32:08,597 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:32:08,598 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:32:08,598 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:32:08,598 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:32:08,598 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:32:08,598 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:32:08,598 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:32:08,598 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:32:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-09-10 02:32:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:32:08,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:08,681 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:32:08,687 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1054134663, now seen corresponding path program 1 times [2019-09-10 02:32:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:08,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:08,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:08,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:09,305 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:32:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:09,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:09,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:09,363 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-09-10 02:32:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:09,564 INFO L93 Difference]: Finished difference Result 637 states and 1008 transitions. [2019-09-10 02:32:09,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:09,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 02:32:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:09,598 INFO L225 Difference]: With dead ends: 637 [2019-09-10 02:32:09,599 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:32:09,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:32:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:32:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:32:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 996 transitions. [2019-09-10 02:32:09,739 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 996 transitions. Word has length 133 [2019-09-10 02:32:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:09,739 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 996 transitions. [2019-09-10 02:32:09,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 996 transitions. [2019-09-10 02:32:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:32:09,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:09,748 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:32:09,748 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash 545110777, now seen corresponding path program 1 times [2019-09-10 02:32:09,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:09,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:09,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:09,970 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:32:09,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:09,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:09,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:09,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:09,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:09,978 INFO L87 Difference]: Start difference. First operand 626 states and 996 transitions. Second operand 4 states. [2019-09-10 02:32:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:10,045 INFO L93 Difference]: Finished difference Result 628 states and 997 transitions. [2019-09-10 02:32:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:10,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 02:32:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:10,051 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:32:10,051 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:32:10,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:32:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:32:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:32:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2019-09-10 02:32:10,075 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 136 [2019-09-10 02:32:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,076 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2019-09-10 02:32:10,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2019-09-10 02:32:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:32:10,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,081 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:32:10,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1596840266, now seen corresponding path program 1 times [2019-09-10 02:32:10,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:10,238 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:32:10,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:10,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:10,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:10,240 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand 4 states. [2019-09-10 02:32:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:10,307 INFO L93 Difference]: Finished difference Result 628 states and 996 transitions. [2019-09-10 02:32:10,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:10,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-10 02:32:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:10,318 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:32:10,318 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:32:10,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:32:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:32:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:32:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-09-10 02:32:10,351 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 137 [2019-09-10 02:32:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,352 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-09-10 02:32:10,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-09-10 02:32:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:32:10,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,357 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:32:10,357 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -794225131, now seen corresponding path program 1 times [2019-09-10 02:32:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:10,556 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:32:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:10,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:10,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:10,559 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-09-10 02:32:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:10,627 INFO L93 Difference]: Finished difference Result 628 states and 995 transitions. [2019-09-10 02:32:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:10,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 02:32:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:10,640 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:32:10,641 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:32:10,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:32:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:32:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:32:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-09-10 02:32:10,665 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 138 [2019-09-10 02:32:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,666 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-09-10 02:32:10,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-09-10 02:32:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:32:10,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,672 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:32:10,672 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1095628306, now seen corresponding path program 1 times [2019-09-10 02:32:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:10,842 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:32:10,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:10,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:10,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:10,844 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-09-10 02:32:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:10,891 INFO L93 Difference]: Finished difference Result 628 states and 994 transitions. [2019-09-10 02:32:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:10,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-10 02:32:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:10,896 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:32:10,896 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:32:10,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:32:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:32:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:32:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-09-10 02:32:10,916 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 139 [2019-09-10 02:32:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,917 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-09-10 02:32:10,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-09-10 02:32:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:32:10,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,923 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:32:10,924 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1964836559, now seen corresponding path program 1 times [2019-09-10 02:32:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,129 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:32:11,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:32:11,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:32:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:32:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:11,131 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 10 states. [2019-09-10 02:32:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,300 INFO L93 Difference]: Finished difference Result 635 states and 1003 transitions. [2019-09-10 02:32:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:32:11,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 02:32:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,309 INFO L225 Difference]: With dead ends: 635 [2019-09-10 02:32:11,309 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:32:11,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:32:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:32:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-10 02:32:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-10 02:32:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-09-10 02:32:11,346 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 140 [2019-09-10 02:32:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:11,347 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-09-10 02:32:11,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:32:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-09-10 02:32:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:32:11,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:11,355 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:32:11,355 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1270189552, now seen corresponding path program 1 times [2019-09-10 02:32:11,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,511 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:32:11,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:11,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:11,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:11,513 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 4 states. [2019-09-10 02:32:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,554 INFO L93 Difference]: Finished difference Result 631 states and 996 transitions. [2019-09-10 02:32:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:11,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-10 02:32:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,560 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:32:11,560 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:32:11,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:32:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:32:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:32:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 978 transitions. [2019-09-10 02:32:11,580 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 978 transitions. Word has length 140 [2019-09-10 02:32:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:11,581 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 978 transitions. [2019-09-10 02:32:11,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 978 transitions. [2019-09-10 02:32:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:32:11,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:11,585 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:32:11,586 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash -730531008, now seen corresponding path program 1 times [2019-09-10 02:32:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:11,711 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:32:11,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:11,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:11,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:11,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:11,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:11,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:11,713 INFO L87 Difference]: Start difference. First operand 620 states and 978 transitions. Second operand 6 states. [2019-09-10 02:32:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,944 INFO L93 Difference]: Finished difference Result 623 states and 981 transitions. [2019-09-10 02:32:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:11,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:32:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,950 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:32:11,951 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:32:11,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:32:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:32:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:32:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 974 transitions. [2019-09-10 02:32:11,980 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 974 transitions. Word has length 141 [2019-09-10 02:32:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:11,982 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 974 transitions. [2019-09-10 02:32:11,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 974 transitions. [2019-09-10 02:32:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:32:11,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:11,988 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:32:11,988 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1761880204, now seen corresponding path program 1 times [2019-09-10 02:32:11,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:11,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:12,165 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:32:12,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:12,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:12,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:12,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:12,167 INFO L87 Difference]: Start difference. First operand 620 states and 974 transitions. Second operand 6 states. [2019-09-10 02:32:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:12,520 INFO L93 Difference]: Finished difference Result 623 states and 977 transitions. [2019-09-10 02:32:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:12,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:32:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:12,525 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:32:12,526 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:32:12,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:32:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:32:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:32:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 970 transitions. [2019-09-10 02:32:12,548 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 970 transitions. Word has length 142 [2019-09-10 02:32:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:12,548 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 970 transitions. [2019-09-10 02:32:12,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 970 transitions. [2019-09-10 02:32:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:32:12,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:12,553 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:32:12,553 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 333743557, now seen corresponding path program 1 times [2019-09-10 02:32:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:12,694 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:32:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:12,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:12,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:12,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:12,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:12,697 INFO L87 Difference]: Start difference. First operand 620 states and 970 transitions. Second operand 6 states. [2019-09-10 02:32:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:12,907 INFO L93 Difference]: Finished difference Result 623 states and 973 transitions. [2019-09-10 02:32:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:12,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 02:32:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:12,913 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:32:12,913 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:32:12,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:32:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:32:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:32:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 966 transitions. [2019-09-10 02:32:12,937 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 966 transitions. Word has length 143 [2019-09-10 02:32:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:12,938 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 966 transitions. [2019-09-10 02:32:12,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 966 transitions. [2019-09-10 02:32:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:32:12,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:12,943 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:32:12,943 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1388216901, now seen corresponding path program 1 times [2019-09-10 02:32:12,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:12,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:13,074 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:32:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:13,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:13,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:13,077 INFO L87 Difference]: Start difference. First operand 620 states and 966 transitions. Second operand 7 states. [2019-09-10 02:32:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:13,161 INFO L93 Difference]: Finished difference Result 623 states and 969 transitions. [2019-09-10 02:32:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:13,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 02:32:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,169 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:32:13,169 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:32:13,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:32:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:32:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:32:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 932 transitions. [2019-09-10 02:32:13,204 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 932 transitions. Word has length 143 [2019-09-10 02:32:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:13,205 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 932 transitions. [2019-09-10 02:32:13,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2019-09-10 02:32:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:32:13,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:13,213 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:32:13,213 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 581281177, now seen corresponding path program 1 times [2019-09-10 02:32:13,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:13,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:13,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:13,367 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:32:13,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:13,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:13,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:13,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:13,371 INFO L87 Difference]: Start difference. First operand 599 states and 932 transitions. Second operand 6 states. [2019-09-10 02:32:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:13,504 INFO L93 Difference]: Finished difference Result 602 states and 935 transitions. [2019-09-10 02:32:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:13,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-10 02:32:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,512 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:32:13,513 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:32:13,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:32:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:32:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:32:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 931 transitions. [2019-09-10 02:32:13,538 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 931 transitions. Word has length 144 [2019-09-10 02:32:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:13,540 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 931 transitions. [2019-09-10 02:32:13,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 931 transitions. [2019-09-10 02:32:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:32:13,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:13,547 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:32:13,547 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash -627276726, now seen corresponding path program 1 times [2019-09-10 02:32:13,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:13,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:13,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:13,719 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:32:13,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:13,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:13,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:13,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:13,722 INFO L87 Difference]: Start difference. First operand 599 states and 931 transitions. Second operand 6 states. [2019-09-10 02:32:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:13,806 INFO L93 Difference]: Finished difference Result 602 states and 934 transitions. [2019-09-10 02:32:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:13,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-10 02:32:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,811 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:32:13,811 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:32:13,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:32:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:32:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:32:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-09-10 02:32:13,837 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 145 [2019-09-10 02:32:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:13,839 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-09-10 02:32:13,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-09-10 02:32:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:32:13,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:13,843 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:32:13,843 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash 269844414, now seen corresponding path program 1 times [2019-09-10 02:32:13,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,048 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:32:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:32:14,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:32:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:32:14,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:32:14,050 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 12 states. [2019-09-10 02:32:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:14,221 INFO L93 Difference]: Finished difference Result 603 states and 933 transitions. [2019-09-10 02:32:14,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:32:14,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 02:32:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:14,226 INFO L225 Difference]: With dead ends: 603 [2019-09-10 02:32:14,226 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:32:14,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:32:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:32:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:32:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:32:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-09-10 02:32:14,247 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 146 [2019-09-10 02:32:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:14,248 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-09-10 02:32:14,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:32:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-09-10 02:32:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:32:14,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:14,252 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:32:14,252 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1889822343, now seen corresponding path program 1 times [2019-09-10 02:32:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:14,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:32:14,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:32:14,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:32:14,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 02:32:14,388 INFO L207 CegarAbsIntRunner]: [62], [63], [320], [324], [327], [343], [345], [347], [384], [385], [387], [388], [389], [391], [394], [396], [400], [456], [856], [858], [877], [897], [917], [937], [957], [959], [988], [989], [990], [992], [1001], [1003], [1016], [1029], [1030], [1032], [1129], [1132], [1137], [1140], [1159], [1162], [1198], [1203], [1236], [1237], [1317], [1319], [1322], [1324], [1330], [1334], [1335], [1371], [1374], [1379], [1384], [1389], [1394], [1399], [1402], [1518], [1575], [1580], [1583], [1602], [1787], [1791], [1795], [1799], [1803], [1807], [1810], [1812], [1828], [1841], [1844], [1850], [1854], [1952], [1953], [2313], [2317], [2320], [2338], [2511], [2512], [2513], [2514], [2515], [2516], [2517], [2518], [2519], [2529], [2530], [2531], [2532], [2553], [2554], [2555], [2556], [2557], [2558], [2565], [2566], [2567], [2568], [2613], [2614], [2625], [2626], [2633], [2634], [2663], [2664], [2665], [2666], [2677], [2678], [2679], [2703], [2704], [2705], [2706], [2711], [2712], [2739], [2740], [2741], [2742], [2743], [2779], [2780], [2781] [2019-09-10 02:32:14,469 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:32:14,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:32:14,578 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:32:14,580 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 137 root evaluator evaluations with a maximum evaluation depth of 0. Performed 137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-09-10 02:32:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:14,584 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:32:14,649 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:32:14,650 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:32:14,659 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-10 02:32:14,659 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:32:14,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:32:14,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:32:14,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:32:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:32:14,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:32:14,661 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 2 states. [2019-09-10 02:32:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:14,662 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:32:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:32:14,662 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-09-10 02:32:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:14,663 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:32:14,663 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:32:14,663 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:32:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:32:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:32:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:32:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:32:14,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-09-10 02:32:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:14,664 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:32:14,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:32:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:32:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:32:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:32:14 BoogieIcfgContainer [2019-09-10 02:32:14,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:32:14,677 INFO L168 Benchmark]: Toolchain (without parser) took 9807.77 ms. Allocated memory was 132.6 MB in the beginning and 407.9 MB in the end (delta: 275.3 MB). Free memory was 85.5 MB in the beginning and 103.6 MB in the end (delta: -18.2 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,679 INFO L168 Benchmark]: CDTParser took 1.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1009.92 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 136.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,687 INFO L168 Benchmark]: Boogie Preprocessor took 170.47 ms. Allocated memory is still 200.8 MB. Free memory was 136.8 MB in the beginning and 127.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,688 INFO L168 Benchmark]: RCFGBuilder took 2465.28 ms. Allocated memory was 200.8 MB in the beginning and 266.9 MB in the end (delta: 66.1 MB). Free memory was 126.6 MB in the beginning and 144.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,689 INFO L168 Benchmark]: TraceAbstraction took 6156.96 ms. Allocated memory was 266.9 MB in the beginning and 407.9 MB in the end (delta: 141.0 MB). Free memory was 144.8 MB in the beginning and 103.6 MB in the end (delta: 41.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:32:14,699 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1009.92 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 136.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.47 ms. Allocated memory is still 200.8 MB. Free memory was 136.8 MB in the beginning and 127.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2465.28 ms. Allocated memory was 200.8 MB in the beginning and 266.9 MB in the end (delta: 66.1 MB). Free memory was 126.6 MB in the beginning and 144.8 MB in the end (delta: -18.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6156.96 ms. Allocated memory was 266.9 MB in the beginning and 407.9 MB in the end (delta: 141.0 MB). Free memory was 144.8 MB in the beginning and 103.6 MB in the end (delta: 41.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 709]: 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 79 procedures, 924 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13362 SDtfs, 442 SDslu, 51650 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=786occurred 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.6643835616438356 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s 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...