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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:05:57,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:05:57,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:05:57,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:05:57,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:05:57,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:05:57,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:05:57,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:05:57,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:05:57,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:05:57,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:05:57,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:05:57,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:05:57,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:05:57,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:05:57,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:05:57,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:05:57,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:05:57,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:05:57,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:05:57,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:05:57,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:05:57,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:05:57,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:05:57,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:05:57,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:05:57,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:05:57,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:05:57,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:05:57,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:05:57,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:05:57,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:05:57,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:05:57,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:05:57,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:05:57,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:05:57,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:05:57,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:05:57,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:05:57,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:05:57,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:05:57,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:05:57,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:05:57,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:05:57,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:05:57,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:05:57,859 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:05:57,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:05:57,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:05:57,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:05:57,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:05:57,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:05:57,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:05:57,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:05:57,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:05:57,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:05:57,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:05:57,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:05:57,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:05:57,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:05:57,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:05:57,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:05:57,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:05:57,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:05:57,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:05:57,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:05:57,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:05:57,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:05:57,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:05:57,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:05:57,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:05:57,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:05:57,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:05:57,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:05:57,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:05:57,919 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:05:57,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-10-02 12:05:57,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350716f6b/7fd90160746c4c0bb7d763692787254b/FLAGc3d1ee9d4 [2019-10-02 12:05:58,668 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:05:58,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product25.cil.c [2019-10-02 12:05:58,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350716f6b/7fd90160746c4c0bb7d763692787254b/FLAGc3d1ee9d4 [2019-10-02 12:05:58,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350716f6b/7fd90160746c4c0bb7d763692787254b [2019-10-02 12:05:58,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:05:58,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:05:58,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:05:58,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:05:58,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:05:58,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:05:58" (1/1) ... [2019-10-02 12:05:58,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:58, skipping insertion in model container [2019-10-02 12:05:58,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:05:58" (1/1) ... [2019-10-02 12:05:58,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:05:58,960 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:05:59,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:05:59,666 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:05:59,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:05:59,884 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:05:59,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59 WrapperNode [2019-10-02 12:05:59,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:05:59,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:05:59,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:05:59,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:05:59,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:05:59,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:05:59,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:05:59,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:06:00,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:06:00,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:06:00,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... [2019-10-02 12:06:00,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:06:00,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:06:00,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:06:00,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:06:00,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:06:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:06:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:06:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:06:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:06:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:06:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:06:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:06:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:06:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:06:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:06:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:06:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:06:00,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:06:00,191 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:06:00,192 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:06:00,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:06:00,194 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:06:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:06:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:06:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:06:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:06:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:06:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:06:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:06:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:06:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:06:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:06:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:06:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:06:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:06:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:06:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:06:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:06:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:06:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:06:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:06:00,201 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:06:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:06:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:06:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:06:00,202 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:06:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:06:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:06:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:06:00,203 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:06:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:06:00,204 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:06:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:06:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:06:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:06:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:06:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:06:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:06:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:06:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:06:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:06:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:06:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:06:00,208 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:06:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:06:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:06:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:06:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:06:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:06:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:06:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:06:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:06:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:06:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:06:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:06:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:06:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:06:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:06:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:06:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:06:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:06:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:06:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:06:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:06:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:06:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:06:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:06:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:06:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:06:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:06:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:06:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:06:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:06:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:06:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:06:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:06:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:06:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:06:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:06:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:06:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:06:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:06:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:06:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:06:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:06:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:06:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:06:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:06:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:06:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:06:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:06:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:06:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:06:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:06:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:06:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:06:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:06:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:06:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:06:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:06:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:06:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:06:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:06:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:06:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:06:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:06:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:06:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:06:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:06:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:06:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:06:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:06:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:06:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:06:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:06:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:06:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:06:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:06:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:06:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:06:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:06:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:06:02,878 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:06:02,879 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:06:02,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:06:02 BoogieIcfgContainer [2019-10-02 12:06:02,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:06:02,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:06:02,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:06:02,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:06:02,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:05:58" (1/3) ... [2019-10-02 12:06:02,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12717458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:06:02, skipping insertion in model container [2019-10-02 12:06:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:59" (2/3) ... [2019-10-02 12:06:02,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12717458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:06:02, skipping insertion in model container [2019-10-02 12:06:02,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:06:02" (3/3) ... [2019-10-02 12:06:02,889 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product25.cil.c [2019-10-02 12:06:02,898 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:06:02,914 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:06:02,935 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:06:02,984 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:06:02,985 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:06:02,985 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:06:02,985 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:06:02,985 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:06:02,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:06:02,986 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:06:02,986 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:06:02,986 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:06:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states. [2019-10-02 12:06:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:06:03,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:03,065 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:03,068 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 896830833, now seen corresponding path program 1 times [2019-10-02 12:06:03,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:03,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:03,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:03,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:03,767 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:03,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:04,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 3204 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:06:04,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:06:04,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:04,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:06:04,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:06:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:06:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:06:04,599 INFO L87 Difference]: Start difference. First operand 759 states. Second operand 4 states. [2019-10-02 12:06:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:04,792 INFO L93 Difference]: Finished difference Result 1202 states and 1951 transitions. [2019-10-02 12:06:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:06:04,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:06:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:04,830 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:06:04,831 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:06:04,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:06:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:06:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:06:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 969 transitions. [2019-10-02 12:06:05,014 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 969 transitions. Word has length 138 [2019-10-02 12:06:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:05,014 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 969 transitions. [2019-10-02 12:06:05,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:06:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 969 transitions. [2019-10-02 12:06:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:06:05,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:05,029 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:05,029 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1824771190, now seen corresponding path program 1 times [2019-10-02 12:06:05,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:05,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:05,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:05,330 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:05,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:05,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 3209 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:05,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:06,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:06,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:06,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:06,058 INFO L87 Difference]: Start difference. First operand 605 states and 969 transitions. Second operand 6 states. [2019-10-02 12:06:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:06,146 INFO L93 Difference]: Finished difference Result 1182 states and 1911 transitions. [2019-10-02 12:06:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:06:06,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 12:06:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:06,152 INFO L225 Difference]: With dead ends: 1182 [2019-10-02 12:06:06,153 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:06:06,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:06:06,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:06:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:06:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 968 transitions. [2019-10-02 12:06:06,188 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 968 transitions. Word has length 142 [2019-10-02 12:06:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:06,189 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 968 transitions. [2019-10-02 12:06:06,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 968 transitions. [2019-10-02 12:06:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:06:06,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:06,194 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:06,195 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:06,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash 48166316, now seen corresponding path program 1 times [2019-10-02 12:06:06,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:06,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:06,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:06,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:06,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:06,332 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:06,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:06,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:06,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:06,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:06,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:06,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:06,995 INFO L87 Difference]: Start difference. First operand 605 states and 968 transitions. Second operand 6 states. [2019-10-02 12:06:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:07,076 INFO L93 Difference]: Finished difference Result 1186 states and 1914 transitions. [2019-10-02 12:06:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:07,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:06:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:07,086 INFO L225 Difference]: With dead ends: 1186 [2019-10-02 12:06:07,086 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:06:07,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:06:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:06:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:06:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 973 transitions. [2019-10-02 12:06:07,139 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 973 transitions. Word has length 144 [2019-10-02 12:06:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:07,140 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 973 transitions. [2019-10-02 12:06:07,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 973 transitions. [2019-10-02 12:06:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:06:07,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:07,145 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:07,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1492609617, now seen corresponding path program 1 times [2019-10-02 12:06:07,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:07,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:07,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:07,312 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:07,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:07,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:06:08,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:08,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:08,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:08,003 INFO L87 Difference]: Start difference. First operand 611 states and 973 transitions. Second operand 6 states. [2019-10-02 12:06:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:08,113 INFO L93 Difference]: Finished difference Result 1185 states and 1905 transitions. [2019-10-02 12:06:08,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:08,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:06:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:08,122 INFO L225 Difference]: With dead ends: 1185 [2019-10-02 12:06:08,123 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:06:08,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:06:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:06:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:06:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 972 transitions. [2019-10-02 12:06:08,157 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 972 transitions. Word has length 145 [2019-10-02 12:06:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:08,158 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 972 transitions. [2019-10-02 12:06:08,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 972 transitions. [2019-10-02 12:06:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:06:08,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:08,164 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:08,164 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1011781872, now seen corresponding path program 1 times [2019-10-02 12:06:08,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:08,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:08,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:06:08,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:08,316 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:08,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 3213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:08,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:09,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:09,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:09,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:09,002 INFO L87 Difference]: Start difference. First operand 611 states and 972 transitions. Second operand 6 states. [2019-10-02 12:06:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:09,080 INFO L93 Difference]: Finished difference Result 1185 states and 1904 transitions. [2019-10-02 12:06:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:09,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:06:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:09,085 INFO L225 Difference]: With dead ends: 1185 [2019-10-02 12:06:09,085 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:06:09,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:06:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:06:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:06:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 971 transitions. [2019-10-02 12:06:09,110 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 971 transitions. Word has length 146 [2019-10-02 12:06:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:09,111 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 971 transitions. [2019-10-02 12:06:09,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 971 transitions. [2019-10-02 12:06:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:06:09,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:09,115 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:09,115 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2009217747, now seen corresponding path program 1 times [2019-10-02 12:06:09,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:09,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:09,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:09,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:06:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:09,292 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:09,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 3214 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:09,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:09,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:09,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:06:09,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:06:09,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:06:09,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:06:09,914 INFO L87 Difference]: Start difference. First operand 611 states and 971 transitions. Second operand 12 states. [2019-10-02 12:06:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:10,602 INFO L93 Difference]: Finished difference Result 1196 states and 1924 transitions. [2019-10-02 12:06:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:06:10,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2019-10-02 12:06:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:10,613 INFO L225 Difference]: With dead ends: 1196 [2019-10-02 12:06:10,614 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:06:10,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:06:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:06:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2019-10-02 12:06:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:06:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 976 transitions. [2019-10-02 12:06:10,650 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 976 transitions. Word has length 147 [2019-10-02 12:06:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:10,652 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 976 transitions. [2019-10-02 12:06:10,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:06:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 976 transitions. [2019-10-02 12:06:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:06:10,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:10,662 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:10,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1945581503, now seen corresponding path program 1 times [2019-10-02 12:06:10,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:10,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:10,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:10,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:11,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 3217 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:11,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:11,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:11,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:11,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:11,537 INFO L87 Difference]: Start difference. First operand 618 states and 976 transitions. Second operand 8 states. [2019-10-02 12:06:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:11,904 INFO L93 Difference]: Finished difference Result 1197 states and 1914 transitions. [2019-10-02 12:06:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:11,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-02 12:06:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:11,919 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:06:11,920 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:06:11,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:06:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:06:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:06:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 971 transitions. [2019-10-02 12:06:11,964 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 971 transitions. Word has length 150 [2019-10-02 12:06:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:11,965 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 971 transitions. [2019-10-02 12:06:11,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 971 transitions. [2019-10-02 12:06:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:06:11,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:11,970 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:11,970 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1740497259, now seen corresponding path program 1 times [2019-10-02 12:06:11,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:11,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:11,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:12,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:12,169 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:12,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:12,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:12,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:12,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:12,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:12,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:12,741 INFO L87 Difference]: Start difference. First operand 618 states and 971 transitions. Second operand 8 states. [2019-10-02 12:06:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:13,049 INFO L93 Difference]: Finished difference Result 1218 states and 1935 transitions. [2019-10-02 12:06:13,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:13,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-10-02 12:06:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:13,055 INFO L225 Difference]: With dead ends: 1218 [2019-10-02 12:06:13,055 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:06:13,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:06:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2019-10-02 12:06:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:06:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 998 transitions. [2019-10-02 12:06:13,085 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 998 transitions. Word has length 152 [2019-10-02 12:06:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:13,086 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 998 transitions. [2019-10-02 12:06:13,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 998 transitions. [2019-10-02 12:06:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:06:13,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:13,090 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:13,091 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1751757003, now seen corresponding path program 1 times [2019-10-02 12:06:13,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:13,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:13,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:13,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:06:13,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:13,200 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:13,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:13,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 3218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:13,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:13,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:13,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:06:13,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:13,920 INFO L87 Difference]: Start difference. First operand 642 states and 998 transitions. Second operand 6 states. [2019-10-02 12:06:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:14,229 INFO L93 Difference]: Finished difference Result 1245 states and 1954 transitions. [2019-10-02 12:06:14,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:14,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-02 12:06:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:14,235 INFO L225 Difference]: With dead ends: 1245 [2019-10-02 12:06:14,235 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:06:14,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:06:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:06:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:06:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 973 transitions. [2019-10-02 12:06:14,264 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 973 transitions. Word has length 152 [2019-10-02 12:06:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:14,265 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 973 transitions. [2019-10-02 12:06:14,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 973 transitions. [2019-10-02 12:06:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:06:14,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:14,269 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:14,270 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1838952981, now seen corresponding path program 1 times [2019-10-02 12:06:14,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:14,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:06:14,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:14,421 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:14,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 3215 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:06:14,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:06:15,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:15,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:06:15,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:06:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:06:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:06:15,117 INFO L87 Difference]: Start difference. First operand 629 states and 973 transitions. Second operand 14 states. [2019-10-02 12:06:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:15,451 INFO L93 Difference]: Finished difference Result 1204 states and 1887 transitions. [2019-10-02 12:06:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:06:15,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-10-02 12:06:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:15,456 INFO L225 Difference]: With dead ends: 1204 [2019-10-02 12:06:15,457 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:06:15,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:06:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 618. [2019-10-02 12:06:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:06:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 956 transitions. [2019-10-02 12:06:15,490 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 956 transitions. Word has length 152 [2019-10-02 12:06:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:15,491 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 956 transitions. [2019-10-02 12:06:15,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:06:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 956 transitions. [2019-10-02 12:06:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:06:15,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:15,495 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:15,495 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1136514263, now seen corresponding path program 1 times [2019-10-02 12:06:15,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:15,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:15,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:15,628 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:16,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 3223 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:16,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:16,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:16,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:06:16,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:16,265 INFO L87 Difference]: Start difference. First operand 618 states and 956 transitions. Second operand 8 states. [2019-10-02 12:06:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:16,461 INFO L93 Difference]: Finished difference Result 1186 states and 1859 transitions. [2019-10-02 12:06:16,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:16,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-02 12:06:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:16,467 INFO L225 Difference]: With dead ends: 1186 [2019-10-02 12:06:16,467 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:06:16,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:06:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:06:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:06:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 955 transitions. [2019-10-02 12:06:16,491 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 955 transitions. Word has length 156 [2019-10-02 12:06:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:16,491 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 955 transitions. [2019-10-02 12:06:16,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 955 transitions. [2019-10-02 12:06:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:06:16,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:16,496 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:16,496 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 97115976, now seen corresponding path program 1 times [2019-10-02 12:06:16,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:16,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:06:16,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:16,701 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:16,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:17,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 3224 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:06:17,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:06:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:17,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:06:17,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:06:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:06:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:06:17,360 INFO L87 Difference]: Start difference. First operand 618 states and 955 transitions. Second operand 18 states. [2019-10-02 12:06:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:18,018 INFO L93 Difference]: Finished difference Result 1202 states and 1886 transitions. [2019-10-02 12:06:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:06:18,019 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-10-02 12:06:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:18,025 INFO L225 Difference]: With dead ends: 1202 [2019-10-02 12:06:18,025 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:06:18,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:06:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:06:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2019-10-02 12:06:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:06:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 963 transitions. [2019-10-02 12:06:18,057 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 963 transitions. Word has length 157 [2019-10-02 12:06:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:18,058 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 963 transitions. [2019-10-02 12:06:18,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:06:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 963 transitions. [2019-10-02 12:06:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:06:18,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:18,066 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:18,066 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -506227811, now seen corresponding path program 1 times [2019-10-02 12:06:18,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:06:18,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:18,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:18,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:18,253 INFO L87 Difference]: Start difference. First operand 629 states and 963 transitions. Second operand 9 states. [2019-10-02 12:06:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:18,434 INFO L93 Difference]: Finished difference Result 1133 states and 1782 transitions. [2019-10-02 12:06:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:18,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:06:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:18,443 INFO L225 Difference]: With dead ends: 1133 [2019-10-02 12:06:18,443 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:06:18,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:06:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:06:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:06:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:06:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 958 transitions. [2019-10-02 12:06:18,476 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 958 transitions. Word has length 158 [2019-10-02 12:06:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:18,477 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 958 transitions. [2019-10-02 12:06:18,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 958 transitions. [2019-10-02 12:06:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:06:18,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:18,483 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:18,484 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1722074909, now seen corresponding path program 1 times [2019-10-02 12:06:18,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:06:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:18,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:18,671 INFO L87 Difference]: Start difference. First operand 626 states and 958 transitions. Second operand 7 states. [2019-10-02 12:06:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:18,798 INFO L93 Difference]: Finished difference Result 1130 states and 1777 transitions. [2019-10-02 12:06:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:06:18,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:06:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:18,803 INFO L225 Difference]: With dead ends: 1130 [2019-10-02 12:06:18,804 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:06:18,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:06:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-10-02 12:06:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-02 12:06:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 928 transitions. [2019-10-02 12:06:18,831 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 928 transitions. Word has length 158 [2019-10-02 12:06:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:18,832 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 928 transitions. [2019-10-02 12:06:18,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 928 transitions. [2019-10-02 12:06:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:06:18,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:18,838 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:18,839 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:18,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1081253702, now seen corresponding path program 1 times [2019-10-02 12:06:18,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:18,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:06:19,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:19,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:06:19,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:06:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:06:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:06:19,136 INFO L87 Difference]: Start difference. First operand 603 states and 928 transitions. Second operand 13 states. [2019-10-02 12:06:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:19,522 INFO L93 Difference]: Finished difference Result 1173 states and 1833 transitions. [2019-10-02 12:06:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:06:19,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-10-02 12:06:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:19,530 INFO L225 Difference]: With dead ends: 1173 [2019-10-02 12:06:19,530 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:06:19,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:06:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:06:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-10-02 12:06:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:06:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 943 transitions. [2019-10-02 12:06:19,562 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 943 transitions. Word has length 160 [2019-10-02 12:06:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:19,562 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 943 transitions. [2019-10-02 12:06:19,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:06:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 943 transitions. [2019-10-02 12:06:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:06:19,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:19,567 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:19,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:19,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080099, now seen corresponding path program 1 times [2019-10-02 12:06:19,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:19,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:19,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:06:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:06:19,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:06:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:06:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:06:19,830 INFO L87 Difference]: Start difference. First operand 615 states and 943 transitions. Second operand 13 states. [2019-10-02 12:06:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:20,161 INFO L93 Difference]: Finished difference Result 1120 states and 1760 transitions. [2019-10-02 12:06:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:06:20,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 12:06:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:20,166 INFO L225 Difference]: With dead ends: 1120 [2019-10-02 12:06:20,166 INFO L226 Difference]: Without dead ends: 608 [2019-10-02 12:06:20,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:06:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-02 12:06:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-02 12:06:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:06:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 934 transitions. [2019-10-02 12:06:20,193 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 934 transitions. Word has length 159 [2019-10-02 12:06:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:20,193 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 934 transitions. [2019-10-02 12:06:20,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:06:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 934 transitions. [2019-10-02 12:06:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:06:20,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:20,198 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:20,198 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash -276534136, now seen corresponding path program 1 times [2019-10-02 12:06:20,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:20,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:06:20,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:20,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:06:20,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:06:20,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:06:20,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:20,426 INFO L87 Difference]: Start difference. First operand 608 states and 934 transitions. Second operand 11 states. [2019-10-02 12:06:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:20,772 INFO L93 Difference]: Finished difference Result 1113 states and 1751 transitions. [2019-10-02 12:06:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:06:20,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-10-02 12:06:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:20,780 INFO L225 Difference]: With dead ends: 1113 [2019-10-02 12:06:20,780 INFO L226 Difference]: Without dead ends: 608 [2019-10-02 12:06:20,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:06:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-02 12:06:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-02 12:06:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:06:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 933 transitions. [2019-10-02 12:06:20,821 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 933 transitions. Word has length 161 [2019-10-02 12:06:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:20,823 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 933 transitions. [2019-10-02 12:06:20,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:06:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 933 transitions. [2019-10-02 12:06:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:06:20,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:20,830 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:20,831 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:20,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:20,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1490619995, now seen corresponding path program 1 times [2019-10-02 12:06:20,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:20,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:20,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:06:21,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:21,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:06:21,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:06:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:06:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:21,055 INFO L87 Difference]: Start difference. First operand 608 states and 933 transitions. Second operand 11 states. [2019-10-02 12:06:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:21,289 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-10-02 12:06:21,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:06:21,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-10-02 12:06:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:21,295 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:06:21,295 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 12:06:21,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:06:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 12:06:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-02 12:06:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-02 12:06:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 925 transitions. [2019-10-02 12:06:21,318 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 925 transitions. Word has length 162 [2019-10-02 12:06:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:21,319 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 925 transitions. [2019-10-02 12:06:21,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:06:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 925 transitions. [2019-10-02 12:06:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:06:21,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:21,323 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:21,323 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 675189955, now seen corresponding path program 1 times [2019-10-02 12:06:21,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:21,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:21,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:21,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:21,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:21,542 INFO L87 Difference]: Start difference. First operand 605 states and 925 transitions. Second operand 9 states. [2019-10-02 12:06:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:26,116 INFO L93 Difference]: Finished difference Result 1107 states and 1757 transitions. [2019-10-02 12:06:26,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:26,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 12:06:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:26,124 INFO L225 Difference]: With dead ends: 1107 [2019-10-02 12:06:26,124 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:06:26,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:06:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:06:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-10-02 12:06:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-10-02 12:06:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 944 transitions. [2019-10-02 12:06:26,163 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 944 transitions. Word has length 163 [2019-10-02 12:06:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:26,165 INFO L475 AbstractCegarLoop]: Abstraction has 609 states and 944 transitions. [2019-10-02 12:06:26,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 944 transitions. [2019-10-02 12:06:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:06:26,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:26,169 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:26,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 611633585, now seen corresponding path program 1 times [2019-10-02 12:06:26,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:26,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:26,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:06:26,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:26,330 INFO L87 Difference]: Start difference. First operand 609 states and 944 transitions. Second operand 8 states. [2019-10-02 12:06:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:32,196 INFO L93 Difference]: Finished difference Result 2033 states and 3330 transitions. [2019-10-02 12:06:32,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:06:32,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-10-02 12:06:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:32,209 INFO L225 Difference]: With dead ends: 2033 [2019-10-02 12:06:32,209 INFO L226 Difference]: Without dead ends: 1533 [2019-10-02 12:06:32,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:06:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2019-10-02 12:06:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1494. [2019-10-02 12:06:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-10-02 12:06:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2369 transitions. [2019-10-02 12:06:32,285 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2369 transitions. Word has length 164 [2019-10-02 12:06:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:32,285 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2369 transitions. [2019-10-02 12:06:32,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:06:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2369 transitions. [2019-10-02 12:06:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:06:32,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:32,289 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:32,289 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash -618292540, now seen corresponding path program 1 times [2019-10-02 12:06:32,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:32,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:32,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:32,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:32,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:32,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:32,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:32,449 INFO L87 Difference]: Start difference. First operand 1494 states and 2369 transitions. Second operand 9 states. [2019-10-02 12:06:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:39,836 INFO L93 Difference]: Finished difference Result 4697 states and 7720 transitions. [2019-10-02 12:06:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:06:39,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-10-02 12:06:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:39,864 INFO L225 Difference]: With dead ends: 4697 [2019-10-02 12:06:39,864 INFO L226 Difference]: Without dead ends: 3312 [2019-10-02 12:06:39,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:06:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2019-10-02 12:06:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3089. [2019-10-02 12:06:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-10-02 12:06:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4982 transitions. [2019-10-02 12:06:40,073 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4982 transitions. Word has length 170 [2019-10-02 12:06:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 3089 states and 4982 transitions. [2019-10-02 12:06:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4982 transitions. [2019-10-02 12:06:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:06:40,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:40,081 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:40,081 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -626051899, now seen corresponding path program 1 times [2019-10-02 12:06:40,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:40,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:40,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:40,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:06:40,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:06:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:06:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:40,265 INFO L87 Difference]: Start difference. First operand 3089 states and 4982 transitions. Second operand 5 states. [2019-10-02 12:06:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:42,830 INFO L93 Difference]: Finished difference Result 6708 states and 10834 transitions. [2019-10-02 12:06:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:42,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-02 12:06:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:42,875 INFO L225 Difference]: With dead ends: 6708 [2019-10-02 12:06:42,876 INFO L226 Difference]: Without dead ends: 4514 [2019-10-02 12:06:42,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2019-10-02 12:06:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 4487. [2019-10-02 12:06:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4487 states. [2019-10-02 12:06:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 7180 transitions. [2019-10-02 12:06:43,204 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 7180 transitions. Word has length 170 [2019-10-02 12:06:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:43,205 INFO L475 AbstractCegarLoop]: Abstraction has 4487 states and 7180 transitions. [2019-10-02 12:06:43,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:06:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 7180 transitions. [2019-10-02 12:06:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:06:43,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:43,212 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:43,212 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1423335943, now seen corresponding path program 1 times [2019-10-02 12:06:43,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:43,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:43,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:43,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:43,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:43,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:43,434 INFO L87 Difference]: Start difference. First operand 4487 states and 7180 transitions. Second operand 7 states. [2019-10-02 12:06:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:47,861 INFO L93 Difference]: Finished difference Result 12305 states and 20170 transitions. [2019-10-02 12:06:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:06:47,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-02 12:06:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:47,919 INFO L225 Difference]: With dead ends: 12305 [2019-10-02 12:06:47,919 INFO L226 Difference]: Without dead ends: 8729 [2019-10-02 12:06:47,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:06:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8729 states. [2019-10-02 12:06:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8729 to 8566. [2019-10-02 12:06:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8566 states. [2019-10-02 12:06:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8566 states to 8566 states and 13874 transitions. [2019-10-02 12:06:48,361 INFO L78 Accepts]: Start accepts. Automaton has 8566 states and 13874 transitions. Word has length 170 [2019-10-02 12:06:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:48,362 INFO L475 AbstractCegarLoop]: Abstraction has 8566 states and 13874 transitions. [2019-10-02 12:06:48,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8566 states and 13874 transitions. [2019-10-02 12:06:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:06:48,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:48,367 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:48,368 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1087108611, now seen corresponding path program 1 times [2019-10-02 12:06:48,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:48,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:48,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:06:48,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:06:48,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:06:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:48,492 INFO L87 Difference]: Start difference. First operand 8566 states and 13874 transitions. Second operand 5 states. [2019-10-02 12:06:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:48,850 INFO L93 Difference]: Finished difference Result 16333 states and 26656 transitions. [2019-10-02 12:06:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:48,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 12:06:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:48,920 INFO L225 Difference]: With dead ends: 16333 [2019-10-02 12:06:48,921 INFO L226 Difference]: Without dead ends: 8788 [2019-10-02 12:06:48,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8788 states. [2019-10-02 12:06:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8788 to 8656. [2019-10-02 12:06:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-10-02 12:06:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 14001 transitions. [2019-10-02 12:06:50,282 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 14001 transitions. Word has length 175 [2019-10-02 12:06:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:50,283 INFO L475 AbstractCegarLoop]: Abstraction has 8656 states and 14001 transitions. [2019-10-02 12:06:50,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:06:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 14001 transitions. [2019-10-02 12:06:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:06:50,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:50,288 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:50,288 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash -216108597, now seen corresponding path program 1 times [2019-10-02 12:06:50,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:50,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:50,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:50,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:06:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:50,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:50,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:50,438 INFO L87 Difference]: Start difference. First operand 8656 states and 14001 transitions. Second operand 7 states. [2019-10-02 12:06:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:50,838 INFO L93 Difference]: Finished difference Result 17317 states and 28602 transitions. [2019-10-02 12:06:50,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:06:50,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:06:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:50,893 INFO L225 Difference]: With dead ends: 17317 [2019-10-02 12:06:50,893 INFO L226 Difference]: Without dead ends: 8656 [2019-10-02 12:06:50,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-10-02 12:06:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8656. [2019-10-02 12:06:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-10-02 12:06:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 13825 transitions. [2019-10-02 12:06:51,367 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 13825 transitions. Word has length 182 [2019-10-02 12:06:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:51,368 INFO L475 AbstractCegarLoop]: Abstraction has 8656 states and 13825 transitions. [2019-10-02 12:06:51,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 13825 transitions. [2019-10-02 12:06:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:06:51,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:51,373 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:51,374 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -304839906, now seen corresponding path program 1 times [2019-10-02 12:06:51,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:51,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:51,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:06:51,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:51,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:51,539 INFO L87 Difference]: Start difference. First operand 8656 states and 13825 transitions. Second operand 7 states. [2019-10-02 12:06:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:56,019 INFO L93 Difference]: Finished difference Result 16949 states and 27239 transitions. [2019-10-02 12:06:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:06:56,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 12:06:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:56,071 INFO L225 Difference]: With dead ends: 16949 [2019-10-02 12:06:56,072 INFO L226 Difference]: Without dead ends: 9331 [2019-10-02 12:06:56,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9331 states. [2019-10-02 12:06:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9331 to 9120. [2019-10-02 12:06:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9120 states. [2019-10-02 12:06:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9120 states to 9120 states and 14451 transitions. [2019-10-02 12:06:56,545 INFO L78 Accepts]: Start accepts. Automaton has 9120 states and 14451 transitions. Word has length 187 [2019-10-02 12:06:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:56,546 INFO L475 AbstractCegarLoop]: Abstraction has 9120 states and 14451 transitions. [2019-10-02 12:06:56,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9120 states and 14451 transitions. [2019-10-02 12:06:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:06:56,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:56,555 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:56,555 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 800615583, now seen corresponding path program 1 times [2019-10-02 12:06:56,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:06:56,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:56,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:56,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:56,708 INFO L87 Difference]: Start difference. First operand 9120 states and 14451 transitions. Second operand 6 states. [2019-10-02 12:06:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:57,249 INFO L93 Difference]: Finished difference Result 21013 states and 33705 transitions. [2019-10-02 12:06:57,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:57,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-10-02 12:06:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:57,319 INFO L225 Difference]: With dead ends: 21013 [2019-10-02 12:06:57,319 INFO L226 Difference]: Without dead ends: 12931 [2019-10-02 12:06:57,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12931 states. [2019-10-02 12:06:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12931 to 11650. [2019-10-02 12:06:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11650 states. [2019-10-02 12:06:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11650 states to 11650 states and 18567 transitions. [2019-10-02 12:06:57,879 INFO L78 Accepts]: Start accepts. Automaton has 11650 states and 18567 transitions. Word has length 192 [2019-10-02 12:06:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:57,880 INFO L475 AbstractCegarLoop]: Abstraction has 11650 states and 18567 transitions. [2019-10-02 12:06:57,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11650 states and 18567 transitions. [2019-10-02 12:06:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:06:57,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:57,884 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:57,885 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1502215457, now seen corresponding path program 1 times [2019-10-02 12:06:57,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:57,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:57,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:06:58,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:58,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:06:58,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:06:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:06:58,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:06:58,024 INFO L87 Difference]: Start difference. First operand 11650 states and 18567 transitions. Second operand 4 states. [2019-10-02 12:06:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:58,927 INFO L93 Difference]: Finished difference Result 23076 states and 37234 transitions. [2019-10-02 12:06:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:58,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-02 12:06:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:58,975 INFO L225 Difference]: With dead ends: 23076 [2019-10-02 12:06:58,975 INFO L226 Difference]: Without dead ends: 11535 [2019-10-02 12:06:59,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11535 states. [2019-10-02 12:06:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11535 to 11535. [2019-10-02 12:06:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11535 states. [2019-10-02 12:06:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11535 states to 11535 states and 18337 transitions. [2019-10-02 12:06:59,621 INFO L78 Accepts]: Start accepts. Automaton has 11535 states and 18337 transitions. Word has length 192 [2019-10-02 12:06:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:59,621 INFO L475 AbstractCegarLoop]: Abstraction has 11535 states and 18337 transitions. [2019-10-02 12:06:59,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:06:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11535 states and 18337 transitions. [2019-10-02 12:06:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:06:59,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:59,627 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:59,627 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash -676252030, now seen corresponding path program 1 times [2019-10-02 12:06:59,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:59,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:59,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:06:59,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:59,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:59,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:59,791 INFO L87 Difference]: Start difference. First operand 11535 states and 18337 transitions. Second operand 6 states. [2019-10-02 12:07:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:00,599 INFO L93 Difference]: Finished difference Result 11606 states and 18460 transitions. [2019-10-02 12:07:00,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:00,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-10-02 12:07:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:00,645 INFO L225 Difference]: With dead ends: 11606 [2019-10-02 12:07:00,646 INFO L226 Difference]: Without dead ends: 11590 [2019-10-02 12:07:00,654 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11590 states. [2019-10-02 12:07:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11590 to 11547. [2019-10-02 12:07:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2019-10-02 12:07:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 18349 transitions. [2019-10-02 12:07:01,086 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 18349 transitions. Word has length 193 [2019-10-02 12:07:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:01,087 INFO L475 AbstractCegarLoop]: Abstraction has 11547 states and 18349 transitions. [2019-10-02 12:07:01,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 18349 transitions. [2019-10-02 12:07:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:07:01,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:01,091 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:01,091 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -794202489, now seen corresponding path program 1 times [2019-10-02 12:07:01,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:07:01,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:01,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:07:01,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:01,464 INFO L87 Difference]: Start difference. First operand 11547 states and 18349 transitions. Second operand 8 states. [2019-10-02 12:07:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:01,756 INFO L93 Difference]: Finished difference Result 11571 states and 18379 transitions. [2019-10-02 12:07:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:01,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-10-02 12:07:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:01,797 INFO L225 Difference]: With dead ends: 11571 [2019-10-02 12:07:01,797 INFO L226 Difference]: Without dead ends: 11555 [2019-10-02 12:07:01,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2019-10-02 12:07:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 11547. [2019-10-02 12:07:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2019-10-02 12:07:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 18325 transitions. [2019-10-02 12:07:02,234 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 18325 transitions. Word has length 199 [2019-10-02 12:07:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:02,234 INFO L475 AbstractCegarLoop]: Abstraction has 11547 states and 18325 transitions. [2019-10-02 12:07:02,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 18325 transitions. [2019-10-02 12:07:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 12:07:02,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:02,241 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:02,241 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1330240185, now seen corresponding path program 1 times [2019-10-02 12:07:02,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:02,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:02,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:07:02,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:02,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:07:02,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:02,428 INFO L87 Difference]: Start difference. First operand 11547 states and 18325 transitions. Second operand 11 states. [2019-10-02 12:07:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:10,802 INFO L93 Difference]: Finished difference Result 25135 states and 40087 transitions. [2019-10-02 12:07:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:07:10,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2019-10-02 12:07:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:10,858 INFO L225 Difference]: With dead ends: 25135 [2019-10-02 12:07:10,858 INFO L226 Difference]: Without dead ends: 14493 [2019-10-02 12:07:10,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:07:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-10-02 12:07:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 13859. [2019-10-02 12:07:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-10-02 12:07:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 21689 transitions. [2019-10-02 12:07:12,266 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 21689 transitions. Word has length 219 [2019-10-02 12:07:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:12,267 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 21689 transitions. [2019-10-02 12:07:12,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:07:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 21689 transitions. [2019-10-02 12:07:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 12:07:12,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:12,271 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:12,272 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1316707384, now seen corresponding path program 1 times [2019-10-02 12:07:12,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:12,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:07:12,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:12,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:12,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:12,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:12,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:12,450 INFO L87 Difference]: Start difference. First operand 13859 states and 21689 transitions. Second operand 9 states. [2019-10-02 12:07:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:16,073 INFO L93 Difference]: Finished difference Result 27667 states and 43545 transitions. [2019-10-02 12:07:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:16,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 12:07:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:16,144 INFO L225 Difference]: With dead ends: 27667 [2019-10-02 12:07:16,144 INFO L226 Difference]: Without dead ends: 13933 [2019-10-02 12:07:16,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:07:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2019-10-02 12:07:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 13859. [2019-10-02 12:07:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13859 states. [2019-10-02 12:07:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13859 states to 13859 states and 21665 transitions. [2019-10-02 12:07:16,749 INFO L78 Accepts]: Start accepts. Automaton has 13859 states and 21665 transitions. Word has length 219 [2019-10-02 12:07:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:16,750 INFO L475 AbstractCegarLoop]: Abstraction has 13859 states and 21665 transitions. [2019-10-02 12:07:16,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:07:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 13859 states and 21665 transitions. [2019-10-02 12:07:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:07:16,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:16,755 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:16,755 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1120146052, now seen corresponding path program 1 times [2019-10-02 12:07:16,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:16,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:07:16,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:16,961 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:17,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:17,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:07:17,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:17,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:07:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:07:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:07:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:07:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:07:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:07:17,699 INFO L87 Difference]: Start difference. First operand 13859 states and 21665 transitions. Second operand 14 states. [2019-10-02 12:07:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:26,361 INFO L93 Difference]: Finished difference Result 29392 states and 46157 transitions. [2019-10-02 12:07:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:07:26,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 228 [2019-10-02 12:07:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:26,427 INFO L225 Difference]: With dead ends: 29392 [2019-10-02 12:07:26,427 INFO L226 Difference]: Without dead ends: 16456 [2019-10-02 12:07:26,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 12:07:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16456 states. [2019-10-02 12:07:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16456 to 16153. [2019-10-02 12:07:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16153 states. [2019-10-02 12:07:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16153 states to 16153 states and 24625 transitions. [2019-10-02 12:07:26,957 INFO L78 Accepts]: Start accepts. Automaton has 16153 states and 24625 transitions. Word has length 228 [2019-10-02 12:07:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:26,958 INFO L475 AbstractCegarLoop]: Abstraction has 16153 states and 24625 transitions. [2019-10-02 12:07:26,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:07:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16153 states and 24625 transitions. [2019-10-02 12:07:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:07:26,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:26,966 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:26,966 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2013864679, now seen corresponding path program 1 times [2019-10-02 12:07:26,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:26,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 12:07:27,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:27,201 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:27,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:27,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3481 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:07:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:07:28,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:07:28,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:07:28,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:07:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:07:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:07:28,173 INFO L87 Difference]: Start difference. First operand 16153 states and 24625 transitions. Second operand 19 states. [2019-10-02 12:07:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:38,406 INFO L93 Difference]: Finished difference Result 49837 states and 77008 transitions. [2019-10-02 12:07:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:07:38,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-10-02 12:07:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:38,527 INFO L225 Difference]: With dead ends: 49837 [2019-10-02 12:07:38,527 INFO L226 Difference]: Without dead ends: 33807 [2019-10-02 12:07:38,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:07:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33807 states. [2019-10-02 12:07:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33807 to 33499. [2019-10-02 12:07:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33499 states. [2019-10-02 12:07:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33499 states to 33499 states and 51641 transitions. [2019-10-02 12:07:39,715 INFO L78 Accepts]: Start accepts. Automaton has 33499 states and 51641 transitions. Word has length 254 [2019-10-02 12:07:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:39,715 INFO L475 AbstractCegarLoop]: Abstraction has 33499 states and 51641 transitions. [2019-10-02 12:07:39,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:07:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33499 states and 51641 transitions. [2019-10-02 12:07:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:07:39,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:39,726 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:39,726 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 619920153, now seen corresponding path program 1 times [2019-10-02 12:07:39,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 12:07:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:39,855 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:40,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:40,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 3482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:40,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:07:40,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:07:40,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:40,822 INFO L87 Difference]: Start difference. First operand 33499 states and 51641 transitions. Second operand 6 states. [2019-10-02 12:07:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:42,107 INFO L93 Difference]: Finished difference Result 68015 states and 106243 transitions. [2019-10-02 12:07:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:07:42,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-10-02 12:07:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:42,255 INFO L225 Difference]: With dead ends: 68015 [2019-10-02 12:07:42,256 INFO L226 Difference]: Without dead ends: 34019 [2019-10-02 12:07:42,347 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34019 states. [2019-10-02 12:07:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34019 to 33989. [2019-10-02 12:07:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33989 states. [2019-10-02 12:07:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33989 states to 33989 states and 51504 transitions. [2019-10-02 12:07:43,965 INFO L78 Accepts]: Start accepts. Automaton has 33989 states and 51504 transitions. Word has length 255 [2019-10-02 12:07:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:43,966 INFO L475 AbstractCegarLoop]: Abstraction has 33989 states and 51504 transitions. [2019-10-02 12:07:43,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 33989 states and 51504 transitions. [2019-10-02 12:07:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 12:07:43,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:43,978 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:43,978 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -839833393, now seen corresponding path program 1 times [2019-10-02 12:07:43,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 12:07:44,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:44,172 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:44,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:44,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 4170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:07:44,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 12:07:44,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:44,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 12:07:44,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:44,950 INFO L87 Difference]: Start difference. First operand 33989 states and 51504 transitions. Second operand 7 states. [2019-10-02 12:07:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:46,428 INFO L93 Difference]: Finished difference Result 69161 states and 105931 transitions. [2019-10-02 12:07:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:46,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-10-02 12:07:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:47,013 INFO L225 Difference]: With dead ends: 69161 [2019-10-02 12:07:47,013 INFO L226 Difference]: Without dead ends: 35289 [2019-10-02 12:07:47,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35289 states. [2019-10-02 12:07:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35289 to 35289. [2019-10-02 12:07:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35289 states. [2019-10-02 12:07:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35289 states to 35289 states and 53776 transitions. [2019-10-02 12:07:48,258 INFO L78 Accepts]: Start accepts. Automaton has 35289 states and 53776 transitions. Word has length 336 [2019-10-02 12:07:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:48,258 INFO L475 AbstractCegarLoop]: Abstraction has 35289 states and 53776 transitions. [2019-10-02 12:07:48,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35289 states and 53776 transitions. [2019-10-02 12:07:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-02 12:07:48,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:48,273 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:48,273 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash 841461537, now seen corresponding path program 1 times [2019-10-02 12:07:48,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:48,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:48,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:48,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 12:07:48,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:48,471 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 4175 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:07:49,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-02 12:07:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:07:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:07:49,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:07:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:07:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:07:49,427 INFO L87 Difference]: Start difference. First operand 35289 states and 53776 transitions. Second operand 15 states. [2019-10-02 12:08:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:05,094 INFO L93 Difference]: Finished difference Result 135182 states and 214269 transitions. [2019-10-02 12:08:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:08:05,095 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-10-02 12:08:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:05,576 INFO L225 Difference]: With dead ends: 135182 [2019-10-02 12:08:05,576 INFO L226 Difference]: Without dead ends: 99439 [2019-10-02 12:08:05,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:08:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99439 states. [2019-10-02 12:08:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99439 to 96833. [2019-10-02 12:08:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96833 states. [2019-10-02 12:08:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96833 states to 96833 states and 149725 transitions. [2019-10-02 12:08:12,425 INFO L78 Accepts]: Start accepts. Automaton has 96833 states and 149725 transitions. Word has length 343 [2019-10-02 12:08:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:12,425 INFO L475 AbstractCegarLoop]: Abstraction has 96833 states and 149725 transitions. [2019-10-02 12:08:12,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:08:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96833 states and 149725 transitions. [2019-10-02 12:08:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 12:08:12,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:12,433 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:12,433 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 257327854, now seen corresponding path program 1 times [2019-10-02 12:08:12,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:12,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:12,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:12,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 12:08:12,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:12,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:12,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:13,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 3811 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:08:13,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 12:08:13,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:13,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:08:13,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:08:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:08:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:13,403 INFO L87 Difference]: Start difference. First operand 96833 states and 149725 transitions. Second operand 14 states. [2019-10-02 12:08:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:33,482 INFO L93 Difference]: Finished difference Result 276203 states and 447567 transitions. [2019-10-02 12:08:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:08:33,483 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 292 [2019-10-02 12:08:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:34,404 INFO L225 Difference]: With dead ends: 276203 [2019-10-02 12:08:34,404 INFO L226 Difference]: Without dead ends: 178905 [2019-10-02 12:08:34,740 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=2179, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 12:08:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178905 states. [2019-10-02 12:08:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178905 to 164189. [2019-10-02 12:08:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164189 states. [2019-10-02 12:08:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164189 states to 164189 states and 257473 transitions. [2019-10-02 12:08:49,903 INFO L78 Accepts]: Start accepts. Automaton has 164189 states and 257473 transitions. Word has length 292 [2019-10-02 12:08:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:49,904 INFO L475 AbstractCegarLoop]: Abstraction has 164189 states and 257473 transitions. [2019-10-02 12:08:49,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:08:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 164189 states and 257473 transitions. [2019-10-02 12:08:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 12:08:49,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:49,924 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:49,924 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash 917888860, now seen corresponding path program 1 times [2019-10-02 12:08:49,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:49,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 12:08:50,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:50,137 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:50,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 3857 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:08:50,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 12:08:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:08:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 12:08:50,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:08:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:08:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:08:50,939 INFO L87 Difference]: Start difference. First operand 164189 states and 257473 transitions. Second operand 12 states. [2019-10-02 12:09:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:13,435 INFO L93 Difference]: Finished difference Result 495017 states and 785390 transitions. [2019-10-02 12:09:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:09:13,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 303 [2019-10-02 12:09:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:15,179 INFO L225 Difference]: With dead ends: 495017 [2019-10-02 12:09:15,180 INFO L226 Difference]: Without dead ends: 331045 [2019-10-02 12:09:15,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:09:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331045 states. [2019-10-02 12:09:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331045 to 329370. [2019-10-02 12:09:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329370 states. [2019-10-02 12:09:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329370 states to 329370 states and 521036 transitions. [2019-10-02 12:09:47,816 INFO L78 Accepts]: Start accepts. Automaton has 329370 states and 521036 transitions. Word has length 303 [2019-10-02 12:09:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:47,816 INFO L475 AbstractCegarLoop]: Abstraction has 329370 states and 521036 transitions. [2019-10-02 12:09:47,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:09:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 329370 states and 521036 transitions. [2019-10-02 12:09:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 12:09:47,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:47,847 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:47,847 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1720814574, now seen corresponding path program 1 times [2019-10-02 12:09:47,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:47,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:47,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 12:09:48,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:48,030 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:48,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:48,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 3858 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:09:48,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 12:09:48,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:09:48,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 12:09:48,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:09:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:09:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:09:48,837 INFO L87 Difference]: Start difference. First operand 329370 states and 521036 transitions. Second operand 12 states. [2019-10-02 12:11:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:10,991 INFO L93 Difference]: Finished difference Result 1326832 states and 2199382 transitions. [2019-10-02 12:11:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:10,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 304 [2019-10-02 12:11:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:16,290 INFO L225 Difference]: With dead ends: 1326832 [2019-10-02 12:11:16,290 INFO L226 Difference]: Without dead ends: 997689 [2019-10-02 12:11:18,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:11:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997689 states. [2019-10-02 12:12:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997689 to 997662. [2019-10-02 12:12:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997662 states.