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_spec3_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:28:50,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:28:50,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:28:50,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:28:50,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:28:50,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:28:50,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:28:50,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:28:50,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:28:50,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:28:50,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:28:50,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:28:50,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:28:50,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:28:50,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:28:50,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:28:50,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:28:50,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:28:50,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:28:50,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:28:50,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:28:50,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:28:50,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:28:50,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:28:50,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:28:50,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:28:50,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:28:50,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:28:50,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:28:50,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:28:50,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:28:50,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:28:50,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:28:50,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:28:50,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:28:50,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:28:50,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:28:50,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:28:50,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:28:50,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:28:50,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:28:50,818 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:28:50,833 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:28:50,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:28:50,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:28:50,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:28:50,835 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:28:50,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:28:50,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:28:50,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:28:50,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:28:50,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:28:50,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:28:50,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:28:50,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:28:50,837 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:28:50,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:28:50,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:28:50,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:28:50,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:28:50,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:28:50,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:28:50,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:28:50,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:28:50,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:28:50,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:28:50,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:28:50,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:28:50,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:28:50,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:28:50,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:28:50,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:28:50,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:28:50,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:28:50,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:28:50,887 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:28:50,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product20.cil.c [2019-10-02 12:28:50,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70302fa2/5c6393b160344eb69b8173a80ccece8d/FLAG2692b502d [2019-10-02 12:28:51,631 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:28:51,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product20.cil.c [2019-10-02 12:28:51,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70302fa2/5c6393b160344eb69b8173a80ccece8d/FLAG2692b502d [2019-10-02 12:28:51,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70302fa2/5c6393b160344eb69b8173a80ccece8d [2019-10-02 12:28:51,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:28:51,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:28:51,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:28:51,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:28:51,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:28:51,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:28:51" (1/1) ... [2019-10-02 12:28:51,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e7ffb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:51, skipping insertion in model container [2019-10-02 12:28:51,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:28:51" (1/1) ... [2019-10-02 12:28:51,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:28:51,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:28:52,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:28:52,688 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:28:52,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:28:52,887 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:28:52,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52 WrapperNode [2019-10-02 12:28:52,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:28:52,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:28:52,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:28:52,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:28:52,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:52,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:52,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:52,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:53,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:53,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:53,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (1/1) ... [2019-10-02 12:28:53,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:28:53,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:28:53,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:28:53,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:28:53,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (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:28:53,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:28:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:28:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:28:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:28:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:28:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:28:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:28:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:28:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:28:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:28:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:28:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:28:53,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:28:53,211 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:28:53,213 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:28:53,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:28:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:28:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:28:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:28:53,216 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:28:53,217 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:28:53,217 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:28:53,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:28:53,217 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:28:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:28:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:28:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:28:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:28:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:28:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:28:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:28:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:28:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:28:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:28:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:28:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:28:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:28:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:28:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:28:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:28:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:28:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:28:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:28:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:28:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:28:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:28:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:28:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:28:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:28:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:28:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:28:53,226 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:28:53,226 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:28:53,226 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:28:53,226 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:28:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:28:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:28:53,227 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:28:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:28:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:28:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:28:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:28:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:28:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:28:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:28:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:28:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:28:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:28:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:28:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:28:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:28:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:28:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:28:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:28:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:28:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:28:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:28:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:28:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:28:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:28:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:28:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:28:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:28:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:28:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:28:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:28:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:28:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:28:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:28:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:28:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:28:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:28:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:28:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:28:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:28:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:28:53,241 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:28:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:28:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:28:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:28:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:28:53,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:28:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:28:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:28:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:28:53,243 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:28:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:28:53,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:28:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:28:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:28:53,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:28:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:28:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:28:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:28:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:28:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:28:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:28:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:28:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:28:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:28:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:28:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:28:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:28:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:28:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:28:53,257 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:28:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:28:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:28:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:28:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:28:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:28:55,877 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:28:55,878 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:28:55,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:28:55 BoogieIcfgContainer [2019-10-02 12:28:55,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:28:55,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:28:55,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:28:55,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:28:55,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:28:51" (1/3) ... [2019-10-02 12:28:55,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a2b880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:28:55, skipping insertion in model container [2019-10-02 12:28:55,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:28:52" (2/3) ... [2019-10-02 12:28:55,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a2b880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:28:55, skipping insertion in model container [2019-10-02 12:28:55,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:28:55" (3/3) ... [2019-10-02 12:28:55,888 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product20.cil.c [2019-10-02 12:28:55,898 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:28:55,908 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:28:55,926 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:28:55,972 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:28:55,973 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:28:55,973 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:28:55,973 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:28:55,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:28:55,974 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:28:55,974 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:28:55,974 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:28:55,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:28:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states. [2019-10-02 12:28:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:28:56,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:56,035 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:56,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash 728591762, now seen corresponding path program 1 times [2019-10-02 12:28:56,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:56,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:56,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:56,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:56,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:56,888 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 7 states. [2019-10-02 12:28:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:57,276 INFO L93 Difference]: Finished difference Result 1283 states and 2064 transitions. [2019-10-02 12:28:57,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-02 12:28:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:57,308 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:28:57,308 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 12:28:57,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 12:28:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-02 12:28:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:28:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1027 transitions. [2019-10-02 12:28:57,460 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1027 transitions. Word has length 93 [2019-10-02 12:28:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:57,461 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1027 transitions. [2019-10-02 12:28:57,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1027 transitions. [2019-10-02 12:28:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:28:57,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:57,469 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:57,469 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2105197679, now seen corresponding path program 1 times [2019-10-02 12:28:57,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:57,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:57,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:57,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:57,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:28:57,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:28:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:28:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:28:57,668 INFO L87 Difference]: Start difference. First operand 648 states and 1027 transitions. Second operand 4 states. [2019-10-02 12:28:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:57,744 INFO L93 Difference]: Finished difference Result 1262 states and 2019 transitions. [2019-10-02 12:28:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:28:57,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:28:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:57,751 INFO L225 Difference]: With dead ends: 1262 [2019-10-02 12:28:57,751 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:28:57,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:28:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:28:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:28:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 994 transitions. [2019-10-02 12:28:57,797 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 994 transitions. Word has length 94 [2019-10-02 12:28:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:57,797 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 994 transitions. [2019-10-02 12:28:57,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:28:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 994 transitions. [2019-10-02 12:28:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:28:57,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:57,803 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:57,803 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1592349723, now seen corresponding path program 1 times [2019-10-02 12:28:57,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:57,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:58,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:58,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:58,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:58,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:58,070 INFO L87 Difference]: Start difference. First operand 630 states and 994 transitions. Second operand 7 states. [2019-10-02 12:28:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:58,302 INFO L93 Difference]: Finished difference Result 1231 states and 1961 transitions. [2019-10-02 12:28:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-02 12:28:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:58,309 INFO L225 Difference]: With dead ends: 1231 [2019-10-02 12:28:58,309 INFO L226 Difference]: Without dead ends: 624 [2019-10-02 12:28:58,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-02 12:28:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-10-02 12:28:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:28:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 981 transitions. [2019-10-02 12:28:58,348 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 981 transitions. Word has length 94 [2019-10-02 12:28:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:58,349 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 981 transitions. [2019-10-02 12:28:58,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 981 transitions. [2019-10-02 12:28:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:28:58,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:58,357 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:58,358 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash 444231126, now seen corresponding path program 1 times [2019-10-02 12:28:58,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:58,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:58,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:58,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:58,617 INFO L87 Difference]: Start difference. First operand 624 states and 981 transitions. Second operand 7 states. [2019-10-02 12:28:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:58,749 INFO L93 Difference]: Finished difference Result 1219 states and 1935 transitions. [2019-10-02 12:28:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:58,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:28:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:58,760 INFO L225 Difference]: With dead ends: 1219 [2019-10-02 12:28:58,760 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:28:58,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:28:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:28:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:28:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 968 transitions. [2019-10-02 12:28:58,798 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 968 transitions. Word has length 95 [2019-10-02 12:28:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:58,798 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 968 transitions. [2019-10-02 12:28:58,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 968 transitions. [2019-10-02 12:28:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:28:58,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:58,804 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:58,804 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1352448671, now seen corresponding path program 1 times [2019-10-02 12:28:58,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:58,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:59,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:59,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:59,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:59,018 INFO L87 Difference]: Start difference. First operand 618 states and 968 transitions. Second operand 7 states. [2019-10-02 12:28:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:59,139 INFO L93 Difference]: Finished difference Result 1207 states and 1909 transitions. [2019-10-02 12:28:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:59,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:28:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:59,154 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:28:59,155 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:28:59,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:28:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:28:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:28:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 955 transitions. [2019-10-02 12:28:59,189 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 955 transitions. Word has length 96 [2019-10-02 12:28:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:59,189 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 955 transitions. [2019-10-02 12:28:59,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 955 transitions. [2019-10-02 12:28:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:28:59,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:59,193 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:59,193 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1553576800, now seen corresponding path program 1 times [2019-10-02 12:28:59,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:59,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:59,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:59,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:59,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:28:59,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:28:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:28:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:28:59,382 INFO L87 Difference]: Start difference. First operand 612 states and 955 transitions. Second operand 7 states. [2019-10-02 12:28:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:59,505 INFO L93 Difference]: Finished difference Result 1195 states and 1883 transitions. [2019-10-02 12:28:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:28:59,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:28:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:59,526 INFO L225 Difference]: With dead ends: 1195 [2019-10-02 12:28:59,526 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:28:59,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:28:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:28:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:28:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:28:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions. [2019-10-02 12:28:59,573 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 96 [2019-10-02 12:28:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:59,574 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 954 transitions. [2019-10-02 12:28:59,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:28:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions. [2019-10-02 12:28:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:28:59,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:59,578 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:59,579 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1582577178, now seen corresponding path program 1 times [2019-10-02 12:28:59,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:59,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:28:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:28:59,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:28:59,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:28:59,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:28:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:28:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:28:59,854 INFO L87 Difference]: Start difference. First operand 612 states and 954 transitions. Second operand 5 states. [2019-10-02 12:28:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:28:59,943 INFO L93 Difference]: Finished difference Result 1194 states and 1880 transitions. [2019-10-02 12:28:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:28:59,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-02 12:28:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:28:59,949 INFO L225 Difference]: With dead ends: 1194 [2019-10-02 12:28:59,950 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:28:59,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:28:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:28:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:28:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:28:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 953 transitions. [2019-10-02 12:28:59,979 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 953 transitions. Word has length 97 [2019-10-02 12:28:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:28:59,979 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 953 transitions. [2019-10-02 12:28:59,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:28:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 953 transitions. [2019-10-02 12:28:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:28:59,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:28:59,982 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:28:59,982 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:28:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:28:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1643629033, now seen corresponding path program 1 times [2019-10-02 12:28:59,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:28:59,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:28:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:28:59,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:28:59,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:00,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:00,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:29:00,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:29:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:29:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:29:00,133 INFO L87 Difference]: Start difference. First operand 612 states and 953 transitions. Second operand 5 states. [2019-10-02 12:29:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:00,262 INFO L93 Difference]: Finished difference Result 1194 states and 1878 transitions. [2019-10-02 12:29:00,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:00,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-02 12:29:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:00,269 INFO L225 Difference]: With dead ends: 1194 [2019-10-02 12:29:00,270 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:29:00,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:29:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:29:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:29:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:29:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 952 transitions. [2019-10-02 12:29:00,309 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 952 transitions. Word has length 98 [2019-10-02 12:29:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:00,310 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 952 transitions. [2019-10-02 12:29:00,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:29:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 952 transitions. [2019-10-02 12:29:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:29:00,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:00,314 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:00,314 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -205792939, now seen corresponding path program 1 times [2019-10-02 12:29:00,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:00,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:00,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:00,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:29:00,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:29:00,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:29:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:29:00,511 INFO L87 Difference]: Start difference. First operand 612 states and 952 transitions. Second operand 5 states. [2019-10-02 12:29:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:00,626 INFO L93 Difference]: Finished difference Result 1194 states and 1876 transitions. [2019-10-02 12:29:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:00,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 12:29:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:00,634 INFO L225 Difference]: With dead ends: 1194 [2019-10-02 12:29:00,634 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:29:00,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:29:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:29:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:29:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:29:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 951 transitions. [2019-10-02 12:29:00,680 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 951 transitions. Word has length 99 [2019-10-02 12:29:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:00,681 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 951 transitions. [2019-10-02 12:29:00,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:29:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 951 transitions. [2019-10-02 12:29:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:29:00,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:00,695 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:00,695 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1150361404, now seen corresponding path program 1 times [2019-10-02 12:29:00,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:00,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:00,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:00,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:00,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:00,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:29:00,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:29:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:29:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:29:00,896 INFO L87 Difference]: Start difference. First operand 612 states and 951 transitions. Second operand 5 states. [2019-10-02 12:29:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:00,978 INFO L93 Difference]: Finished difference Result 1194 states and 1874 transitions. [2019-10-02 12:29:00,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:00,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 12:29:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:00,983 INFO L225 Difference]: With dead ends: 1194 [2019-10-02 12:29:00,983 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:29:00,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:29:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:29:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:29:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:29:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 950 transitions. [2019-10-02 12:29:01,013 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 950 transitions. Word has length 100 [2019-10-02 12:29:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:01,013 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 950 transitions. [2019-10-02 12:29:01,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:29:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 950 transitions. [2019-10-02 12:29:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:29:01,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:01,015 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:01,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash 185725072, now seen corresponding path program 1 times [2019-10-02 12:29:01,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:01,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:01,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:01,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:01,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:01,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:29:01,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:29:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:29:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:29:01,220 INFO L87 Difference]: Start difference. First operand 612 states and 950 transitions. Second operand 8 states. [2019-10-02 12:29:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:04,768 INFO L93 Difference]: Finished difference Result 2235 states and 3531 transitions. [2019-10-02 12:29:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:29:04,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-02 12:29:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:04,781 INFO L225 Difference]: With dead ends: 2235 [2019-10-02 12:29:04,782 INFO L226 Difference]: Without dead ends: 1657 [2019-10-02 12:29:04,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:29:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-10-02 12:29:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1645. [2019-10-02 12:29:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-10-02 12:29:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2558 transitions. [2019-10-02 12:29:04,860 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2558 transitions. Word has length 101 [2019-10-02 12:29:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:04,861 INFO L475 AbstractCegarLoop]: Abstraction has 1645 states and 2558 transitions. [2019-10-02 12:29:04,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:29:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2558 transitions. [2019-10-02 12:29:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:29:04,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:04,863 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:04,863 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 962074000, now seen corresponding path program 1 times [2019-10-02 12:29:04,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:04,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 12:29:05,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:05,054 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:29:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:05,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:29:05,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:29:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:29:05,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:29:05,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:29:05,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:29:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:29:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:29:05,968 INFO L87 Difference]: Start difference. First operand 1645 states and 2558 transitions. Second operand 12 states. [2019-10-02 12:29:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:14,227 INFO L93 Difference]: Finished difference Result 8066 states and 13139 transitions. [2019-10-02 12:29:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:29:14,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-02 12:29:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:14,298 INFO L225 Difference]: With dead ends: 8066 [2019-10-02 12:29:14,299 INFO L226 Difference]: Without dead ends: 6455 [2019-10-02 12:29:14,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:29:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-10-02 12:29:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 4167. [2019-10-02 12:29:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4167 states. [2019-10-02 12:29:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 6561 transitions. [2019-10-02 12:29:14,711 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 6561 transitions. Word has length 101 [2019-10-02 12:29:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:14,712 INFO L475 AbstractCegarLoop]: Abstraction has 4167 states and 6561 transitions. [2019-10-02 12:29:14,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:29:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 6561 transitions. [2019-10-02 12:29:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 12:29:14,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:14,858 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:14,859 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash -128546951, now seen corresponding path program 1 times [2019-10-02 12:29:14,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:14,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:15,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:15,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:29:15,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:29:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:29:15,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:29:15,048 INFO L87 Difference]: Start difference. First operand 4167 states and 6561 transitions. Second operand 7 states. [2019-10-02 12:29:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:18,506 INFO L93 Difference]: Finished difference Result 12343 states and 19923 transitions. [2019-10-02 12:29:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:29:18,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-02 12:29:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:18,575 INFO L225 Difference]: With dead ends: 12343 [2019-10-02 12:29:18,576 INFO L226 Difference]: Without dead ends: 8210 [2019-10-02 12:29:18,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:29:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2019-10-02 12:29:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 8122. [2019-10-02 12:29:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2019-10-02 12:29:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 12908 transitions. [2019-10-02 12:29:19,048 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 12908 transitions. Word has length 104 [2019-10-02 12:29:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:19,049 INFO L475 AbstractCegarLoop]: Abstraction has 8122 states and 12908 transitions. [2019-10-02 12:29:19,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:29:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 12908 transitions. [2019-10-02 12:29:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 12:29:19,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:19,051 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:19,051 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash 422139196, now seen corresponding path program 1 times [2019-10-02 12:29:19,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:19,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:19,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:29:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:19,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:19,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:19,239 INFO L87 Difference]: Start difference. First operand 8122 states and 12908 transitions. Second operand 4 states. [2019-10-02 12:29:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:19,638 INFO L93 Difference]: Finished difference Result 15841 states and 25449 transitions. [2019-10-02 12:29:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:19,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-02 12:29:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:19,705 INFO L225 Difference]: With dead ends: 15841 [2019-10-02 12:29:19,705 INFO L226 Difference]: Without dead ends: 7741 [2019-10-02 12:29:19,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:29:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2019-10-02 12:29:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7719. [2019-10-02 12:29:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7719 states. [2019-10-02 12:29:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 12247 transitions. [2019-10-02 12:29:20,186 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 12247 transitions. Word has length 105 [2019-10-02 12:29:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:20,186 INFO L475 AbstractCegarLoop]: Abstraction has 7719 states and 12247 transitions. [2019-10-02 12:29:20,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 12247 transitions. [2019-10-02 12:29:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 12:29:20,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:20,190 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:29:20,190 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 53496904, now seen corresponding path program 1 times [2019-10-02 12:29:20,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 12:29:20,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:20,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:29:20,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:29:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:29:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:29:20,469 INFO L87 Difference]: Start difference. First operand 7719 states and 12247 transitions. Second operand 7 states. [2019-10-02 12:29:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:24,171 INFO L93 Difference]: Finished difference Result 23081 states and 37687 transitions. [2019-10-02 12:29:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:29:24,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-02 12:29:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:24,301 INFO L225 Difference]: With dead ends: 23081 [2019-10-02 12:29:24,302 INFO L226 Difference]: Without dead ends: 15396 [2019-10-02 12:29:24,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:29:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15396 states. [2019-10-02 12:29:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15396 to 15272. [2019-10-02 12:29:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15272 states. [2019-10-02 12:29:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15272 states to 15272 states and 24621 transitions. [2019-10-02 12:29:25,076 INFO L78 Accepts]: Start accepts. Automaton has 15272 states and 24621 transitions. Word has length 113 [2019-10-02 12:29:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:25,077 INFO L475 AbstractCegarLoop]: Abstraction has 15272 states and 24621 transitions. [2019-10-02 12:29:25,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:29:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15272 states and 24621 transitions. [2019-10-02 12:29:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:29:25,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:25,080 INFO L411 BasicCegarLoop]: trace histogram [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:29:25,080 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1202684267, now seen corresponding path program 1 times [2019-10-02 12:29:25,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:25,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:29:25,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:25,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:25,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:25,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:25,210 INFO L87 Difference]: Start difference. First operand 15272 states and 24621 transitions. Second operand 4 states. [2019-10-02 12:29:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:25,833 INFO L93 Difference]: Finished difference Result 30191 states and 49230 transitions. [2019-10-02 12:29:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:25,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 12:29:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:25,942 INFO L225 Difference]: With dead ends: 30191 [2019-10-02 12:29:25,942 INFO L226 Difference]: Without dead ends: 14941 [2019-10-02 12:29:25,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:29:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14941 states. [2019-10-02 12:29:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14941 to 14901. [2019-10-02 12:29:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14901 states. [2019-10-02 12:29:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14901 states to 14901 states and 23979 transitions. [2019-10-02 12:29:27,611 INFO L78 Accepts]: Start accepts. Automaton has 14901 states and 23979 transitions. Word has length 114 [2019-10-02 12:29:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:27,611 INFO L475 AbstractCegarLoop]: Abstraction has 14901 states and 23979 transitions. [2019-10-02 12:29:27,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 14901 states and 23979 transitions. [2019-10-02 12:29:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:29:27,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:27,613 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:29:27,613 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:27,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1104399514, now seen corresponding path program 1 times [2019-10-02 12:29:27,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:27,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:29:27,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:27,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:29:27,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:29:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:29:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:29:27,764 INFO L87 Difference]: Start difference. First operand 14901 states and 23979 transitions. Second operand 7 states. [2019-10-02 12:29:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:31,624 INFO L93 Difference]: Finished difference Result 44743 states and 74586 transitions. [2019-10-02 12:29:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:29:31,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-10-02 12:29:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:31,857 INFO L225 Difference]: With dead ends: 44743 [2019-10-02 12:29:31,857 INFO L226 Difference]: Without dead ends: 29876 [2019-10-02 12:29:31,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:29:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29876 states. [2019-10-02 12:29:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29876 to 29692. [2019-10-02 12:29:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29692 states. [2019-10-02 12:29:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29692 states to 29692 states and 48998 transitions. [2019-10-02 12:29:34,190 INFO L78 Accepts]: Start accepts. Automaton has 29692 states and 48998 transitions. Word has length 123 [2019-10-02 12:29:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:34,190 INFO L475 AbstractCegarLoop]: Abstraction has 29692 states and 48998 transitions. [2019-10-02 12:29:34,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:29:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29692 states and 48998 transitions. [2019-10-02 12:29:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:29:34,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:34,192 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:29:34,193 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1662690101, now seen corresponding path program 1 times [2019-10-02 12:29:34,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 12:29:34,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:34,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:34,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:34,304 INFO L87 Difference]: Start difference. First operand 29692 states and 48998 transitions. Second operand 4 states. [2019-10-02 12:29:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:35,206 INFO L93 Difference]: Finished difference Result 59081 states and 98868 transitions. [2019-10-02 12:29:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:35,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-02 12:29:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:35,422 INFO L225 Difference]: With dead ends: 59081 [2019-10-02 12:29:35,422 INFO L226 Difference]: Without dead ends: 29411 [2019-10-02 12:29:35,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:29:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29411 states. [2019-10-02 12:29:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29411 to 29335. [2019-10-02 12:29:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29335 states. [2019-10-02 12:29:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29335 states to 29335 states and 48323 transitions. [2019-10-02 12:29:36,667 INFO L78 Accepts]: Start accepts. Automaton has 29335 states and 48323 transitions. Word has length 124 [2019-10-02 12:29:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:36,668 INFO L475 AbstractCegarLoop]: Abstraction has 29335 states and 48323 transitions. [2019-10-02 12:29:36,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29335 states and 48323 transitions. [2019-10-02 12:29:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:29:36,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:36,669 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:29:36,670 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -98700217, now seen corresponding path program 1 times [2019-10-02 12:29:36,670 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:36,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:36,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:29:36,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:36,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:29:36,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:29:36,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:29:36,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:29:36,795 INFO L87 Difference]: Start difference. First operand 29335 states and 48323 transitions. Second operand 7 states. [2019-10-02 12:29:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:41,330 INFO L93 Difference]: Finished difference Result 88217 states and 152173 transitions. [2019-10-02 12:29:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:29:41,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-02 12:29:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:41,784 INFO L225 Difference]: With dead ends: 88217 [2019-10-02 12:29:41,784 INFO L226 Difference]: Without dead ends: 58916 [2019-10-02 12:29:41,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:29:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58916 states. [2019-10-02 12:29:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58916 to 58632. [2019-10-02 12:29:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58632 states. [2019-10-02 12:29:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58632 states to 58632 states and 100413 transitions. [2019-10-02 12:29:45,966 INFO L78 Accepts]: Start accepts. Automaton has 58632 states and 100413 transitions. Word has length 134 [2019-10-02 12:29:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:45,967 INFO L475 AbstractCegarLoop]: Abstraction has 58632 states and 100413 transitions. [2019-10-02 12:29:45,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:29:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58632 states and 100413 transitions. [2019-10-02 12:29:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:29:45,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:45,968 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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:29:45,969 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1017675526, now seen corresponding path program 1 times [2019-10-02 12:29:45,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:45,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:45,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:45,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:29:46,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:29:46,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:29:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:29:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:29:46,110 INFO L87 Difference]: Start difference. First operand 58632 states and 100413 transitions. Second operand 4 states. [2019-10-02 12:29:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:47,767 INFO L93 Difference]: Finished difference Result 116272 states and 202767 transitions. [2019-10-02 12:29:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:29:47,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:29:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:50,839 INFO L225 Difference]: With dead ends: 116272 [2019-10-02 12:29:50,839 INFO L226 Difference]: Without dead ends: 57656 [2019-10-02 12:29:51,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:29:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57656 states. [2019-10-02 12:29:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57656 to 57512. [2019-10-02 12:29:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57512 states. [2019-10-02 12:29:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57512 states to 57512 states and 98126 transitions. [2019-10-02 12:29:52,914 INFO L78 Accepts]: Start accepts. Automaton has 57512 states and 98126 transitions. Word has length 135 [2019-10-02 12:29:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:52,914 INFO L475 AbstractCegarLoop]: Abstraction has 57512 states and 98126 transitions. [2019-10-02 12:29:52,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:29:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 57512 states and 98126 transitions. [2019-10-02 12:29:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:29:52,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:52,916 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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:29:52,916 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash -408867468, now seen corresponding path program 1 times [2019-10-02 12:29:52,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:52,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:52,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:29:53,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:29:53,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:29:53,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:29:53,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:29:53,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:29:53,047 INFO L87 Difference]: Start difference. First operand 57512 states and 98126 transitions. Second operand 3 states. [2019-10-02 12:29:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:29:54,631 INFO L93 Difference]: Finished difference Result 117775 states and 199571 transitions. [2019-10-02 12:29:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:29:54,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-02 12:29:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:29:55,076 INFO L225 Difference]: With dead ends: 117775 [2019-10-02 12:29:55,077 INFO L226 Difference]: Without dead ends: 61516 [2019-10-02 12:29:57,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:29:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61516 states. [2019-10-02 12:29:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61516 to 60954. [2019-10-02 12:29:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60954 states. [2019-10-02 12:29:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60954 states to 60954 states and 104227 transitions. [2019-10-02 12:29:59,393 INFO L78 Accepts]: Start accepts. Automaton has 60954 states and 104227 transitions. Word has length 136 [2019-10-02 12:29:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:29:59,394 INFO L475 AbstractCegarLoop]: Abstraction has 60954 states and 104227 transitions. [2019-10-02 12:29:59,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:29:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 60954 states and 104227 transitions. [2019-10-02 12:29:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:29:59,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:29:59,398 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-10-02 12:29:59,398 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:29:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:29:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1816972749, now seen corresponding path program 1 times [2019-10-02 12:29:59,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:29:59,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:29:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:59,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:29:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:29:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:29:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:29:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:29:59,970 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:30:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:00,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 3418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:30:00,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:30:00,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:00,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:30:00,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:30:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:30:00,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:30:00,788 INFO L87 Difference]: Start difference. First operand 60954 states and 104227 transitions. Second operand 13 states. [2019-10-02 12:30:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:05,638 INFO L93 Difference]: Finished difference Result 134406 states and 247274 transitions. [2019-10-02 12:30:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:30:05,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 195 [2019-10-02 12:30:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:06,098 INFO L225 Difference]: With dead ends: 134406 [2019-10-02 12:30:06,098 INFO L226 Difference]: Without dead ends: 73486 [2019-10-02 12:30:06,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-10-02 12:30:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73486 states. [2019-10-02 12:30:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73486 to 69786. [2019-10-02 12:30:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69786 states. [2019-10-02 12:30:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69786 states to 69786 states and 118017 transitions. [2019-10-02 12:30:09,210 INFO L78 Accepts]: Start accepts. Automaton has 69786 states and 118017 transitions. Word has length 195 [2019-10-02 12:30:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:09,210 INFO L475 AbstractCegarLoop]: Abstraction has 69786 states and 118017 transitions. [2019-10-02 12:30:09,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:30:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 69786 states and 118017 transitions. [2019-10-02 12:30:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 12:30:09,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:09,243 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-02 12:30:09,244 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1417449010, now seen corresponding path program 1 times [2019-10-02 12:30:09,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:09,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:09,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-02 12:30:09,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:09,513 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:30:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:10,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 4119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:30:10,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 133 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:30:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:30:10,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:30:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:30:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:30:10,516 INFO L87 Difference]: Start difference. First operand 69786 states and 118017 transitions. Second operand 15 states. [2019-10-02 12:30:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:16,635 INFO L93 Difference]: Finished difference Result 140170 states and 248851 transitions. [2019-10-02 12:30:16,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:30:16,636 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-10-02 12:30:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:17,093 INFO L225 Difference]: With dead ends: 140170 [2019-10-02 12:30:17,093 INFO L226 Difference]: Without dead ends: 70418 [2019-10-02 12:30:17,370 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:30:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70418 states. [2019-10-02 12:30:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70418 to 70418. [2019-10-02 12:30:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70418 states. [2019-10-02 12:30:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70418 states to 70418 states and 118552 transitions. [2019-10-02 12:30:19,934 INFO L78 Accepts]: Start accepts. Automaton has 70418 states and 118552 transitions. Word has length 303 [2019-10-02 12:30:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:19,934 INFO L475 AbstractCegarLoop]: Abstraction has 70418 states and 118552 transitions. [2019-10-02 12:30:19,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:30:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 70418 states and 118552 transitions. [2019-10-02 12:30:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 12:30:19,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:19,971 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,972 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1760444578, now seen corresponding path program 1 times [2019-10-02 12:30:19,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-02 12:30:20,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:20,249 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:30:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:21,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 4123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:30:21,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-02 12:30:21,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:21,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:30:21,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:30:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:30:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:30:21,901 INFO L87 Difference]: Start difference. First operand 70418 states and 118552 transitions. Second operand 15 states. [2019-10-02 12:30:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:27,145 INFO L93 Difference]: Finished difference Result 141554 states and 249822 transitions. [2019-10-02 12:30:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:30:27,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 306 [2019-10-02 12:30:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:27,577 INFO L225 Difference]: With dead ends: 141554 [2019-10-02 12:30:27,578 INFO L226 Difference]: Without dead ends: 71170 [2019-10-02 12:30:27,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:30:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71170 states. [2019-10-02 12:30:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71170 to 71170. [2019-10-02 12:30:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71170 states. [2019-10-02 12:30:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71170 states to 71170 states and 119255 transitions. [2019-10-02 12:30:34,307 INFO L78 Accepts]: Start accepts. Automaton has 71170 states and 119255 transitions. Word has length 306 [2019-10-02 12:30:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:34,308 INFO L475 AbstractCegarLoop]: Abstraction has 71170 states and 119255 transitions. [2019-10-02 12:30:34,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:30:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 71170 states and 119255 transitions. [2019-10-02 12:30:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:30:34,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:34,341 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:34,341 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash 750489502, now seen corresponding path program 1 times [2019-10-02 12:30:34,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:34,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:34,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 12:30:34,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:34,629 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:30:34,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:35,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 4127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:30:35,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-02 12:30:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:30:35,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:30:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:30:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:30:35,631 INFO L87 Difference]: Start difference. First operand 71170 states and 119255 transitions. Second operand 15 states. [2019-10-02 12:30:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:40,133 INFO L93 Difference]: Finished difference Result 143170 states and 251185 transitions. [2019-10-02 12:30:40,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:30:40,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 310 [2019-10-02 12:30:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:40,587 INFO L225 Difference]: With dead ends: 143170 [2019-10-02 12:30:40,588 INFO L226 Difference]: Without dead ends: 72034 [2019-10-02 12:30:40,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:30:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72034 states. [2019-10-02 12:30:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72034 to 72034. [2019-10-02 12:30:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72034 states. [2019-10-02 12:30:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72034 states to 72034 states and 120094 transitions. [2019-10-02 12:30:48,245 INFO L78 Accepts]: Start accepts. Automaton has 72034 states and 120094 transitions. Word has length 310 [2019-10-02 12:30:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:48,245 INFO L475 AbstractCegarLoop]: Abstraction has 72034 states and 120094 transitions. [2019-10-02 12:30:48,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:30:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 72034 states and 120094 transitions. [2019-10-02 12:30:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-10-02 12:30:48,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:48,268 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:30:48,268 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 270627197, now seen corresponding path program 1 times [2019-10-02 12:30:48,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:48,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-10-02 12:30:48,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:48,634 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:30:48,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:49,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 5206 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:30:49,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 284 proven. 20 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-10-02 12:30:49,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:30:49,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-02 12:30:49,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:30:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:30:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:30:49,991 INFO L87 Difference]: Start difference. First operand 72034 states and 120094 transitions. Second operand 19 states. [2019-10-02 12:31:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:57,284 INFO L93 Difference]: Finished difference Result 447711 states and 949163 transitions. [2019-10-02 12:31:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 12:31:57,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 485 [2019-10-02 12:31:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:00,108 INFO L225 Difference]: With dead ends: 447711 [2019-10-02 12:32:00,108 INFO L226 Difference]: Without dead ends: 356835 [2019-10-02 12:32:00,812 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 12:32:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356835 states. [2019-10-02 12:32:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356835 to 336709. [2019-10-02 12:32:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336709 states. [2019-10-02 12:32:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336709 states to 336709 states and 602230 transitions. [2019-10-02 12:32:40,387 INFO L78 Accepts]: Start accepts. Automaton has 336709 states and 602230 transitions. Word has length 485 [2019-10-02 12:32:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:40,388 INFO L475 AbstractCegarLoop]: Abstraction has 336709 states and 602230 transitions. [2019-10-02 12:32:40,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:32:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 336709 states and 602230 transitions. [2019-10-02 12:32:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-10-02 12:32:40,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:40,402 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-10-02 12:32:40,402 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1283615665, now seen corresponding path program 1 times [2019-10-02 12:32:40,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:40,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:40,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-10-02 12:32:40,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:32:40,867 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:32:41,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:41,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 5246 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 12:32:42,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:32:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 291 proven. 2 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-10-02 12:32:42,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:32:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-10-02 12:32:42,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:32:42,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:32:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:32:42,332 INFO L87 Difference]: Start difference. First operand 336709 states and 602230 transitions. Second operand 24 states. [2019-10-02 12:34:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:24,260 INFO L93 Difference]: Finished difference Result 1073637 states and 2166649 transitions. [2019-10-02 12:34:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:34:24,261 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 503 [2019-10-02 12:34:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:46,218 INFO L225 Difference]: With dead ends: 1073637 [2019-10-02 12:34:46,219 INFO L226 Difference]: Without dead ends: 736962 [2019-10-02 12:34:54,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:34:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736962 states.